https://blueriverlhr.github.io/tags/algorithm/Recent content in Algorithm on bLueriVerHugoen-usFri, 15 May 2026 19:38:00 +0800https://blueriverlhr.github.io/posts/algo/Fri, 15 May 2026 19:38:00 +0800https://blueriverlhr.github.io/posts/algo/<h2 id="stable-sort">Stable Sort</h2> <p>Definition: A sorting algorithm is said to be <code>stable</code> if two objects with equal keys appear in the same order in sorted output as they appear in the input data set.</p> <p><strong>Stable</strong>:</p> <ul> <li>Stable by nature <ul> <li>Bubble Sort</li> <li>Insertion Sort</li> <li>Merge Sort</li> <li>Count Sort</li> </ul> </li> <li>Non-comparison-based sorts <ul> <li>Counting Sort <ul> <li>the Sorted Array is filled in reverse order</li> </ul> </li> </ul> </li> <li>Sorts depend on another sort: the only requirement that the other sort should be stable <ul> <li>Radix Sort</li> </ul> </li> </ul> <p><strong>Unstable</strong>:</p>