DSA · Theory

Difference between Comb Sort and Shell Sort

Theory

291/810

Difference between Comb Sort and Shell Sort

Difference between Comb Sort and Shell Sort is a DSA topic. In plain words you use it for names A→Z in the roll list. Don’t start with a slogan — start with that picture.

Smallest example: n log n vs n². Type it, run it, and say what you see. If you can do that from memory, you know Difference between Comb Sort and Shell Sort.

From the example next to this theory — Difference between Comb Sort and Shell Sort: dry-run [4, 1, 3].

Trap — unstable sort when equal keys matter. Fix that before you talk about advanced DSA.

Viva — what is Difference between Comb Sort and Shell Sort? Then show n log n vs n². Then name the trap.

Exam tip

What is Difference between Comb Sort and Shell Sort? Show this: n log n vs n². Trap: unstable sort when equal keys matter.

Example

# Difference between Comb Sort and Shell Sort
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Difference between Comb Sort and Shell Sort: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefDifference between Comb Sort and Shell Sort — names A→Z in the roll list.
Rulen log n vs n²
Trapunstable sort when equal keys matter
Usethe roll list

DSA · Theory

Difference between Comb Sort and Shell Sort

← All stacks

Theory

291/810

Difference between Comb Sort and Shell Sort

Difference between Comb Sort and Shell Sort is a DSA topic. In plain words you use it for names A→Z in the roll list. Don’t start with a slogan — start with that picture.

Smallest example: n log n vs n². Type it, run it, and say what you see. If you can do that from memory, you know Difference between Comb Sort and Shell Sort.

From the example next to this theory — Difference between Comb Sort and Shell Sort: dry-run [4, 1, 3].

Trap — unstable sort when equal keys matter. Fix that before you talk about advanced DSA.

Viva — what is Difference between Comb Sort and Shell Sort? Then show n log n vs n². Then name the trap.

Exam tip

What is Difference between Comb Sort and Shell Sort? Show this: n log n vs n². Trap: unstable sort when equal keys matter.

Example

# Difference between Comb Sort and Shell Sort
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Difference between Comb Sort and Shell Sort: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefDifference between Comb Sort and Shell Sort — names A→Z in the roll list.
Rulen log n vs n²
Trapunstable sort when equal keys matter
Usethe roll list

Difference between Comb Sort and Shell Sort

Example

Short notes

Questions

Difference between Comb Sort and Shell Sort

Example

Short notes

Questions