Counting sort: Samuel's tutorial
Samuel's tutorial for the counting sort algorithm (runtime complexity and Python implementation).
Timestamps:
00:00 - Counting Sort
01:23 - Counting Sort Implementation
Detailed description:
Counting sort was introduced by Harold Seward in 1954 as part of his master's thesis. This video describes the properties of counting sort (it is a stable, non-comparison sort) and its runtime (Big Theta of n + k, where n is the number of data items to sort k is the number of possible integer keys).
We then walk through a Python implementation of counting sort, illustrating how it works in practice.
Topics: #counting #sorting #algorithms
Python code to implement counting sort can be found here: https://github.com/albanie/algorithms...
Slides (pdf): https://samuelalbanie.com/files/diges...
References for papers mentioned in the video can be found at
http://samuelalbanie.com/digests/2023...
For related content:
YouTube: / @samuelalbanie1
Twitter: / samuelalbanie