DSA · Theory

Bitonic Sort

Theory

140/810

If you can teach Bitonic Sort using names A→Z, you know it. If you only know the heading, you don’t.

Do Bitonic Sort once by hand. n log n vs n². Change one input. Say the new result out loud.

Skip Bitonic Sort and unstable sort when equal keys matter shows up in the roll list.

Use Bitonic Sort when names A→Z must stay clear. If a simpler DSA step works, use that instead.

If names A→Z breaks under Bitonic Sort, check unstable sort when equal keys matter first.

After Bitonic Sort, Amit should still remember unstable sort when equal keys matter.

One breath for Bitonic Sort, then names A→Z, then unstable sort when equal keys matter. Sit down.

Exam tip

Board: names A→Z. Dry-run Bitonic Sort. Name the trap: unstable sort when equal keys matter.

# Bitonic 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)

Bitonic Sort: dry-run [4, 1, 3]. Say the list after one step.