01Which sorting algorithm has O(n) best-case complexity?
02What is the worst-case complexity of Quick Sort?
03Which sort is 'Stable'?
04What is the space complexity of Merge Sort?
05Which algorithm is non-comparison-based?
06What is the 'Pivot' in Quick Sort?
07Which sort is used by C++ `std::sort` (typically)?
08What is the complexity of Heap Sort?
09Selection Sort always performs O(n²) comparisons because:
10Bubble Sort can be optimized by: