🔥🔥 sorting algorithms → Sorting algorithms rely on the ordered-array invariant as the correctness target; many exploit ordered subarrays for binary search and merging, and account for O(n) shifts in contiguous arrays when designing insertion and merge strategies.

🔥 binary search → Binary search depends on the array being sorted so midpoint comparisons can discard half the search space; random-access indexing of an ordered array ensures O(log n) checks.

⚡️ two pointer technique →

⚡️ merge algorithm →

⚡️ range query →