DSA · Theory

Sort an almost-sorted, k-sorted or nearly-sorted array

Theory

221/810

Sort an almost-sorted, k-sorted or nearly-sorted array sits in the roll list. Vikram’s job is names A→Z. Write that first.

Sort an almost-sorted, k-sorted or nearly-sorted array order: meaning → n log n vs n² → one limit. Dumping ten features helps nobody.

Sort an almost-sorted, k-sorted or nearly-sorted array exists so Vikram can keep names A→Z correct in the roll list.

Use Sort an almost-sorted, k-sorted or nearly-sorted array when names A→Z must stay clear. If a simpler DSA step works, use that instead.

Don’t do this with Sort an almost-sorted, k-sorted or nearly-sorted array: unstable sort when equal keys matter. Interviewers spot it in ten seconds.

After Sort an almost-sorted, k-sorted or nearly-sorted array, Vikram should still remember unstable sort when equal keys matter.

One breath for Sort an almost-sorted, k-sorted or nearly-sorted array, then names A→Z, then unstable sort when equal keys matter. Sit down.

Diagram

  index →  0    1    2
  array → [10,  20,  30]

Exam tip

Say Sort an almost-sorted, k-sorted or nearly-sorted array in one breath, then n log n vs n², then unstable sort when equal keys matter.

arr = [10, 20, 30, 40]
print(arr[2], arr[-1])
matrix = [[1, 2], [3, 4]]
print(matrix[1][0])  # 3

Sort an almost-sorted, k-sorted or nearly-sorted array — arrays give O(1) index access; matrices are arrays of arrays.

DefSort an almost-sorted, k-sorted or nearly-sorted array — Vikram uses it for names A→Z in the roll list.
RuleSort an almost-sorted, k-sorted or nearly-sorted array → n log n vs n².
RememberSort an almost-sorted, k-sorted or nearly-sorted array + time vs memory (the roll list).
UseSort an almost-sorted, k-sorted or nearly-sorted array in the roll list (names A→Z).
TrapSort an almost-sorted, k-sorted or nearly-sorted array — unstable sort when equal keys matter.
ExSort an almost-sorted, k-sorted or nearly-sorted array → names A→Z.