--- title: "#sorting-algorithms articles | Hashnode" description: "Explore 178 articles tagged #sorting-algorithms on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/sorting-algorithms" --- Tag # #sorting-algorithms 178 posts · 8 followers [Annet](https://hashnode.com/@annet-) · [Jul 31](https://hashnode.com/posts/mastering-sorting-algorithms-in-python-my-dsa-learning-journey/6a6cdafa2ba44b2ca2dfb861) ### [Mastering Sorting Algorithms in Python: My DSA Learning Journey](https://html-portfolio.hashnode.dev/mastering-sorting-algorithms-in-python-my-dsa-learning-journey?utm_source=hashnode&utm_medium=feed) Learn Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, and Quick Sort in Python with easy explanations, code examples, and outputs for beginners. 7 min read · [html-portfolio.hashnode.dev](https://html-portfolio.hashnode.dev/mastering-sorting-algorithms-in-python-my-dsa-learning-journey?utm_source=hashnode&utm_medium=feed) [Bikash Mainali](https://hashnode.com/@bikash8848) · [Jul 6](https://hashnode.com/posts/merge-sort/6a4b30c5642e2bd9296dcda1) ### [Merge Sort:](https://dsa-3956.hashnode.dev/merge-sort?utm_source=hashnode&utm_medium=feed) package sort; import java.util.Arrays; public class L01\_MergeSort { public static void mergeSort(int\[\] arr) { // Base case: if array has 1 element, it’s already sorted if (arr.l 6 min read · [dsa-3956.hashnode.dev](https://dsa-3956.hashnode.dev/merge-sort?utm_source=hashnode&utm_medium=feed) [Aadarsha Dumre](https://hashnode.com/@adarshadumre) · [May 22](https://hashnode.com/posts/bubble-sort-vs-insertion-sort-vs-selection-sort-performance-analysis-implementation/6a100eb41f237623eac4598f) ### [Bubble Sort vs Insertion Sort vs Selection Sort — Performance Analysis & Implementation](https://analysis-of-algorithm.hashnode.dev/bubble-sort-vs-insertion-sort-vs-selection-sort-performance-analysis-implementation?utm_source=hashnode&utm_medium=feed) A practical guide comparing Bubble, Insertion, and Selection Sorts: clear explanations of how each algorithm operates, their O(n²) time complexity, behavior on different input orders and sizes, performance trade-offs, and example implementations. 6 min read · [analysis-of-algorithm.hashnode.dev](https://analysis-of-algorithm.hashnode.dev/bubble-sort-vs-insertion-sort-vs-selection-sort-performance-analysis-implementation?utm_source=hashnode&utm_medium=feed) [Md Azad](https://hashnode.com/@azad-10) · [Apr 13](https://hashnode.com/posts/the-fastest-sorting-algorithm-it-depends-a-deep-dive-into-performance-on-modern-hardware/69dc9631be21b1bd0149e7ec) ### [The Fastest Sorting Algorithm? It Depends. A Deep Dive into Performance on Modern Hardware](https://sortingperformance.hashnode.dev/the-fastest-sorting-algorithm-it-depends-a-deep-dive-into-performance-on-modern-hardware?utm_source=hashnode&utm_medium=feed) This article explores why there is no single “fastest” sorting algorithm and shows how performance depends on data patterns, input size, and modern CP 9 min read · [sortingperformance.hashnode.dev](https://sortingperformance.hashnode.dev/the-fastest-sorting-algorithm-it-depends-a-deep-dive-into-performance-on-modern-hardware?utm_source=hashnode&utm_medium=feed) [Shubham Kumar Singh](https://hashnode.com/@shubhamsinghbundela) · [Apr 7](https://hashnode.com/posts/sort-0-1-2-dutch-national-flag-algorithm/69d5014a5da14bc70e515091) ### [Sort 0, 1, 2 (Dutch National Flag Algorithm)](https://shubhamsinghbundela.hashnode.dev/sort-0-1-2-dutch-national-flag-algorithm?utm_source=hashnode&utm_medium=feed) Sort 0, 1, and 2 using the Dutch National Flag algorithm. Learn the 3-pointer approach with step-by-step explanation in O(n) time and O(1) space. 3 min read · [shubhamsinghbundela.hashnode.dev](https://shubhamsinghbundela.hashnode.dev/sort-0-1-2-dutch-national-flag-algorithm?utm_source=hashnode&utm_medium=feed) [Awadhe Hossain](https://hashnode.com/@awadhehossain) · [Apr 3](https://hashnode.com/posts/insertion-sort/69d024a7e466e2b7627f15b4) ### [Insertion Sort](https://data-structure-algorithms.hashnode.dev/insertion-sort?utm_source=hashnode&utm_medium=feed) What is insertion sort? Insertion sort is a sorting Algorithm that work from left to right : Assuming the first element is already sorted. Compare the second element with the first element if the se 1 min read · [data-structure-algorithms.hashnode.dev](https://data-structure-algorithms.hashnode.dev/insertion-sort?utm_source=hashnode&utm_medium=feed) [vibha yadav](https://hashnode.com/@vibha07) · [Mar 26](https://hashnode.com/posts/sorting-in-javascript-why-it-confuses-everyone-at-first/69c5291710e664c5dac4ff30) ### [Sorting in JavaScript (Why It Confuses Everyone at First 😅)](https://vibha07.hashnode.dev/sorting-in-javascript-why-it-confuses-everyone-at-first?utm_source=hashnode&utm_medium=feed) If you’re learning JavaScript, there’s a high chance you’ve tried this: \[10, 2, 5\].sort(); And expected: \[2, 5, 10\] But instead, you got: \[10, 2, 5\] At this point, most people think: “Is JavaScript 3 min read · [vibha07.hashnode.dev](https://vibha07.hashnode.dev/sorting-in-javascript-why-it-confuses-everyone-at-first?utm_source=hashnode&utm_medium=feed) [Faisal Sayed](https://hashnode.com/@sayedfaixal) · [Jan 17](https://hashnode.com/posts/my-mitr-learning-media-interview-experience/696bc4bd7703cd773ead9b72) ### [My MITR Learning Media Interview Experience: How Basics and Balance Helped Me Clear the Interview](https://faisal-interview-diaries.hashnode.dev/my-mitr-learning-media-interview-experience?utm_source=hashnode&utm_medium=feed) https://www.mitrmedia.com/ 5 min read · [faisal-interview-diaries.hashnode.dev](https://faisal-interview-diaries.hashnode.dev/my-mitr-learning-media-interview-experience?utm_source=hashnode&utm_medium=feed) [Saptarshi Sarkar](https://hashnode.com/@SaptarshiSarkar) · [Jan 10](https://hashnode.com/posts/cyclic-sort-made-simple/69629939f24b34ac65caf672) ### [Cyclic Sort Made Simple: Learn the Basics and How It Works](https://saptarshisarkar.hashnode.dev/cyclic-sort-made-simple?utm_source=hashnode&utm_medium=feed) Learn how the cyclic sort algorithm works to efficiently sort arrays in place with O(n) time complexity 4 min read · [saptarshisarkar.hashnode.dev](https://saptarshisarkar.hashnode.dev/cyclic-sort-made-simple?utm_source=hashnode&utm_medium=feed) [Yumi Miura](https://hashnode.com/@yumyum116) · [Jan 2](https://hashnode.com/posts/implementing-shell-sort-from-theory-to-practical-code/6957ced61fb8ae722db7351e) ### [Implementing Shell Sort: From Theory to Practical Code](https://pythoneryumi.hashnode.dev/implementing-shell-sort-from-theory-to-practical-code?utm_source=hashnode&utm_medium=feed) A practical guide to implementing Shell sort, covering algorithm theory, gap sequences, time complexity, and real-world coding examples. 4 min read · [pythoneryumi.hashnode.dev](https://pythoneryumi.hashnode.dev/implementing-shell-sort-from-theory-to-practical-code?utm_source=hashnode&utm_medium=feed)