Sorting Algorithms Series

Sorting algorithms are fundamental to computer science, and choosing the right one can make a significant difference in efficiency. Whether you need to sort a million integers or merge two already-ordered arrays, the algorithm’s time complexity, stability, and memory requirements all matter.

This guide covers the full spectrum of sorting: from foundational comparisons and merge sort to quicksort, heapsort, adaptive algorithms, and specialized non-comparison sorts. Each section focuses on a distinct family of algorithms, with analysis of their trade-offs and real-world applicability.

Sorting Fundamentals

• Insertion Sort vs. Bubble Sort Algorithms
• Stable Sorting Algorithms
• Counting Sort vs. Bucket Sort vs. Radix Sort
• External Sorting vs Internal Sorting
• Which Sorting Algorithm to Use?
• Worst Sorting Algorithms – What to Avoid

Merge Sort

• Merge Sort: Top-Down vs. Bottom-up
• 2-Way and K-Way Merging
• Non-Recursive Merge Sort
• Merge Two Sorted Arrays Into a Sorted Array
• In-Place Sorting With Merge Sort
• When Will the Worst Case of Merge Sort Occur?

QuickSort

• An Overview of QuickSort Algorithm
• Understanding the Randomized Quicksort
• Quicksort vs. Mergesort
• Complexity Analysis of QuickSelect
• Quicksort vs. Heapsort
• Quicksort Worst Case Time Complexity

Heapsort and Adaptive Sorts

• How Does Timsort Work?
• Tournament Sort Algorithm
• Understanding Heapsort
• Why Isn’t Heapsort Stable?
• The Complexity of Shellsort

Specialized Sorting Algorithms

• Cycle Sort Algorithm
• Binary Insertion Sort
• Cocktail Sort
• Bitonic Sort
• Radix Sort
• Gravity/Bead Sort