Рет қаралды 14,107
Support us on Patreon: / geekific
GitHub Repository: github.com/geekific-official/...
Stay updated on our videos by subscribing to the channel and hitting the like button!
So far, we’ve been enriching our sorting algorithm series with algorithms that are able to sort any type of objects. But what if we needed to sort only integers, and in particular small ints, are these algorithms still the best choice out there? Or do we have more performant ones we can rely on? Well, one of these specialized algorithms goes by Counting Sort and is covered and implemented in this video.
Timestamps:
00:00 Introduction
00:35 What is Counting Sort?
02:11 Sorting an array using Counting Sort!
03:59 Counting Sort Implementation
06:45 Putting our Code to the Test
07:29 Counting Sort Implementation v2.0
11:34 Performance and Complexity
12:22 Thanks for Watching!
If you found this video helpful, check other Geekific uploads:
- Merge Sort (MergeSort) - Explained and Implemented: • Merge Sort Algorithm E...
- Quick Sort (QuickSort) - Explained and Implemented: • Quick Sort Algorithm E...
- LinkedList Implementation in Java: • Implementing the Linke...
- New Features in Java 17: • New Features in Java 1...
- Sorting Algorithms Complexity: • Sorting Algorithms Tim...
- Generics and Wildcards in Java Made Simple: • Generics and Wildcards...
- Heap Space vs. Stack Memory in Java: • Heap Space vs. Stack M...
- Graphs, The Fundamentals: • Introduction to Graphs...
- Introduction to Unit-Testing with TDD: • Introduction to Unit-T...
- Dual-Pivot Quicksort Explained and Implemented in Java: • Dual-Pivot Quicksort E...
- TimSort Explained and Implemented in Java: • TimSort Explained and ...
#Geekific #SortingAlgorithms #CountingSort #Java