DSA · Theory

Find Minimum in Rotated Sorted Array

Theory

343/810

If you can teach Find Minimum in Rotated Sorted Array using names A→Z, you know it. If you only know the heading, you don’t.

Find Minimum in Rotated Sorted Array on the board: n log n vs n². Then say what names A→Z looks like after.

Without Find Minimum in Rotated Sorted Array, the roll list gets messy and names A→Z is hard to trust.

Isha ships Find Minimum in Rotated Sorted Array in the roll list. That is the use case worth saying.

Find Minimum in Rotated Sorted Array trap: unstable sort when equal keys matter. Isha loses marks for that every viva.

After Find Minimum in Rotated Sorted Array, Isha should still remember unstable sort when equal keys matter.

Viva for Find Minimum in Rotated Sorted Array: what it is → n log n vs n² → the mistake (unstable sort when equal keys matter).

Diagram

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

Exam tip

For Find Minimum in Rotated Sorted Array: definition + the roll list + one failure.

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

Find Minimum in Rotated Sorted Array — arrays give O(1) index access; matrices are arrays of arrays.

DefFind Minimum in Rotated Sorted Array — Isha uses it for names A→Z in the roll list.
RuleFind Minimum in Rotated Sorted Array → n log n vs n².
RememberFind Minimum in Rotated Sorted Array + Big-O (the roll list).
UseFind Minimum in Rotated Sorted Array in the roll list (names A→Z).
TrapFind Minimum in Rotated Sorted Array — unstable sort when equal keys matter.
ExFind Minimum in Rotated Sorted Array → names A→Z.