--- title: "#counting-sort articles | Hashnode" description: "Explore 11 articles tagged #counting-sort on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/counting-sort" --- Tag # #counting-sort 11 posts · 0 followers [Rahul Kumar](https://hashnode.com/@rahul-713) · [Nov 2, 2025](https://hashnode.com/posts/searching-and-sorting-algorithms/69074ed20c19f35935a3a24a) ### [Searching and Sorting Algorithms](https://data-structures-and-algorithms-notes.hashnode.dev/searching-and-sorting-algorithms?utm_source=hashnode&utm_medium=feed) Learn binary search, merge sort, quick sort, and more with time complexities and code examples 18 min read · [data-structures-and-algorithms-notes.hashnode.dev](https://data-structures-and-algorithms-notes.hashnode.dev/searching-and-sorting-algorithms?utm_source=hashnode&utm_medium=feed) [EJ Jung](https://hashnode.com/@ejjung) · [Jun 25, 2025](https://hashnode.com/posts/algorithms-sorting-algorithms-2/685b94b7bdddbff0c4ef98f3) ### [Key Sorting Algorithms Every Coder Should Know - 2](https://ejjung.hashnode.dev/algorithms-sorting-algorithms-2?utm_source=hashnode&utm_medium=feed) Learn Quick, Merge, Heap, and Counting Sort, their time/space complexities, and stability 3 min read · [ejjung.hashnode.dev](https://ejjung.hashnode.dev/algorithms-sorting-algorithms-2?utm_source=hashnode&utm_medium=feed) [Lim Woojae](https://hashnode.com/@jaylog) · [May 12, 2025](https://hashnode.com/posts/cs-fundamentals-sorting-algorithms/682166f03c01206780100732) ### [\[CS Fundamentals\] Sorting Algorithms](https://jaylog.hashnode.dev/cs-fundamentals-sorting-algorithms?utm_source=hashnode&utm_medium=feed) Sorting Algorithm Average Time Complexity Space Complexity Characteristics Selection Sort O(N²) O(N) The idea is simple Insertion Sort O(N²) O(N) 4 min read · [jaylog.hashnode.dev](https://jaylog.hashnode.dev/cs-fundamentals-sorting-algorithms?utm_source=hashnode&utm_medium=feed) [Vaishnavi Dwivedi](https://hashnode.com/@vaishD) · [Mar 9, 2025](https://hashnode.com/posts/sorting-all-the-way-to-dsa/67cd48250ba0779365f5a620) ### [Sorting All the way to DSA](https://vaishd.hashnode.dev/sorting-all-the-way-to-dsa?utm_source=hashnode&utm_medium=feed) Explore essential sorting algorithms in DSA using Java. Learn Bubble Sort, Quick Sort, Merge Sort, Heap Sort, and more with step-by-step explanations, time 38 min read · [vaishd.hashnode.dev](https://vaishd.hashnode.dev/sorting-all-the-way-to-dsa?utm_source=hashnode&utm_medium=feed) [Namra Ajmal](https://hashnode.com/@NamraAjmal) · [Aug 18, 2024](https://hashnode.com/posts/mastering-counting-sort-a-comprehensive-guide/66c22b22c491ee1aa11b1d20) ### [Mastering Counting Sort: A Comprehensive Guide](https://datanerd.hashnode.dev/mastering-counting-sort-a-comprehensive-guide?utm_source=hashnode&utm_medium=feed) Everything you need to know about counting sort at one place 5 min read · [datanerd.hashnode.dev](https://datanerd.hashnode.dev/mastering-counting-sort-a-comprehensive-guide?utm_source=hashnode&utm_medium=feed) [Nile Bits](https://hashnode.com/@nilebits) · [Jun 28, 2024](https://hashnode.com/posts/sorting-algorithms-mastering-the-fundamentals-in-javascript/667eb5b2b5e6bce6b3473fa4) ### [Sorting Algorithms: Mastering the Fundamentals in JavaScript](https://nilebits.hashnode.dev/sorting-algorithms-mastering-the-fundamentals-in-javascript?utm_source=hashnode&utm_medium=feed) An essential idea in software engineering and computer science is sorting algorithms. They are necessary to enable effective searching, retrieval, and 10 min read · [nilebits.hashnode.dev](https://nilebits.hashnode.dev/sorting-algorithms-mastering-the-fundamentals-in-javascript?utm_source=hashnode&utm_medium=feed) [Tapan Rachchh](https://hashnode.com/@tapanrachchh) · [Jun 14, 2024](https://hashnode.com/posts/945-minimum-increment-to-make-array-unique/666bc3cd06c2cd21b1e5d26a) ### [945\. Minimum Increment to Make Array Unique](https://tapanrachchh.hashnode.dev/945-minimum-increment-to-make-array-unique?utm_source=hashnode&utm_medium=feed) class Solution: def minIncrementForUnique(self, nums: List\[int\]) -> int: nums.sort() ans = 0 for i in range(len(nums) - 1): if nums\[i\] >= nums\[i + 1\]: ans += 1 + (nums\[i\] - nums\[i + 1\]) ... 1 min read · [tapanrachchh.hashnode.dev](https://tapanrachchh.hashnode.dev/945-minimum-increment-to-make-array-unique?utm_source=hashnode&utm_medium=feed) [Md. Naimur Rahman (Navil)](https://hashnode.com/@NaimurNavil) · [Mar 15, 2024](https://hashnode.com/posts/data-structure-algorithm-l/65f48a4079146a01c33d6a40) ### [Data Structure & Algorithm l](https://navilbyte.hashnode.dev/data-structure-algorithm-l?utm_source=hashnode&utm_medium=feed) "Master DSA 1: Essential data structures and algorithms for efficient coding and problem-solving." 1 min read · [navilbyte.hashnode.dev](https://navilbyte.hashnode.dev/data-structure-algorithm-l?utm_source=hashnode&utm_medium=feed) [Ayesha Irshad](https://hashnode.com/@AyeshaIrshad1337) · [Aug 15, 2023](https://hashnode.com/posts/heap-sort-and-counting-sort-unveiling-efficient-sorting-techniques/64db2333aa2fe9bbdcc5cf7c) ### [Heap Sort and Counting Sort: Unveiling Efficient Sorting Techniques](https://ayeshairshad.hashnode.dev/heap-sort-and-counting-sort-unveiling-efficient-sorting-techniques?utm_source=hashnode&utm_medium=feed) Dive into the world of sorting algorithms with Heap Sort and Counting Sort. Discover how Heap Sort leverages the power of priority while Counting Sort excel 3 min read · [ayeshairshad.hashnode.dev](https://ayeshairshad.hashnode.dev/heap-sort-and-counting-sort-unveiling-efficient-sorting-techniques?utm_source=hashnode&utm_medium=feed) [Ayesha Irshad](https://hashnode.com/@AyeshaIrshad1337) · [Aug 10, 2023](https://hashnode.com/posts/unlocking-linear-sorting-exploring-algorithms-and-solving-leetcode-challenges/64d45d4c2f8fdb05e4af60f0) ### [Unlocking Linear Sorting: Exploring Algorithms and Solving LeetCode Challenges](https://ayeshairshad.hashnode.dev/unlocking-linear-sorting-exploring-algorithms-and-solving-leetcode-challenges?utm_source=hashnode&utm_medium=feed) Dive into linear sorting algorithms, Counting Sort and Radix Sort, unraveling their linear time complexity magic. Solve a LeetCode challenge using these. 2 min read · [ayeshairshad.hashnode.dev](https://ayeshairshad.hashnode.dev/unlocking-linear-sorting-exploring-algorithms-and-solving-leetcode-challenges?utm_source=hashnode&utm_medium=feed)