Revisiting classic searching and sorting algorithms with a focus on advanced applications and non-comparison sorts.
Mastering binary search and its application on the answer space for optimization problems.
Adapting binary search to find an element in a sorted array that has been rotated.
Understanding the divide-and-conquer strategy of Merge Sort and its stability.
Implementing Quicksort, understanding pivot selection, and analyzing its average vs. worst-case performance.
Using a binary heap data structure to perform an O(n log n) in-place sort.
Exploring non-comparison sorts like Counting Sort and Radix Sort for linear-time sorting.