#CS#Algorithm#Sorting
Sorting Algorithms: Bubble, Selection, Insertion
The Big 3 of O(N²) sorting. Why Bubble Sort is banned in production? When is Insertion Sort faster than Quick Sort?
April 20, 2025
Codemapo
The Big 3 of O(N²) sorting. Why Bubble Sort is banned in production? When is Insertion Sort faster than Quick Sort?
Why does my server crash? OS's desperate struggle to manage limited memory. War against Fragmentation.
Two ways to escape a maze. Spread out wide (BFS) or dig deep (DFS)? Who finds the shortest path?
Fast by name. Partitioning around a Pivot. Why is it the standard library choice despite O(N²) worst case?
Establishing TCP connection is expensive. Reuse it for multiple requests.
I used to think sorting algorithms were just academic exercises. "Why memorize Bubble Sort when sort() exists?"
But understanding their characteristics—Time Complexity, Space Complexity, Stability, and Adaptiveness—gave me a new lens to view code. It taught me that there is no "Best" algorithm. Only the "Right" algorithm for the current data.
The O(N²) trio might be slow for Big Data, but they are the building blocks of algorithmic thinking. Before jumping to Quick Sort, make sure you truly understand why Insertion Sort is still king in small neighborhoods.