1. Introduction. The hook of today


In Part 1, we saw the world of O(n²) sorts: simple, intuitive, but inefficient for large data. Now we step into a higher league: algorithms that use divide and conquer to reach O(n log n) time.

Today we’ll explore:



Merge Sort: stable and elegant, built on recursive merging.


Quick Sort: practical and...