DSA · Theory

Cycle Sort

Theory

143/810

Cycle 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 Cycle Sort.

From the example next to this theory — Cycle Sort: dry-run [4, 1, 3].

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

Viva — what is Cycle Sort? Then show n log n vs n². Then name the trap.

Exam tip

What is Cycle Sort? Show this: n log n vs n². Trap: unstable sort when equal keys matter.

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

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