Sorting Algorithms

Understand fundamental sorting algorithms, from simple to advanced, and their trade-offs.

•   01 Bubble Sort A simple comparison-based sorting algorithm.
•   02 Selection Sort An in-place comparison sorting algorithm.
•   03 Insertion Sort Builds the final sorted array one item at a time.
•   04 Merge Sort An efficient, stable, divide-and-conquer sorting algorithm.
•   05 Quick Sort An efficient in-place, divide-and-conquer sorting algorithm.

WONDERING, HOW DOES IT COVER PATTERNS?
These algorithms cover two major sorting paradigms:

Bubble, Selection & Insertion Sort → Simple, quadratic time complexity (O(n²)) sorts. Good for understanding basics.
Merge Sort & Quick Sort → Efficient, log-linear time complexity (O(n log n)) sorts based on the Divide and Conquer pattern.

Together, they provide a strong foundation, contrasting simple brute-force methods with efficient recursive approaches.