Overview
This lesson covers two sorting algorithms that use the distribution sort method: bucket sort and radix sort. This is different than the other sorting algorithms we’ve met so far, which use the comparison sorting method.
Prerequisites
- Big O Notation
- Intro to Sorting Algorithms
- Basic Sorting Algorithms
Learning Objectives
By the end of this module, learners will be able to:
- Explain how bucket sort and radix sort work.
- Identify scenarios in which bucket sort and radix sort should be used.
- Describe the time complexity of bucket sort.
- Implement bucket sort.
Content
There are two components to this module:
- Lesson: Distribution Sorting Algorithms
- Exercise: Implementing Bucket Sort
Solution Code
- Exercise Solution: Bucket Sort
Time to Complete
1.5 hours total:
- 0.5 hour - Distribution Sorting Algorithms Lesson
- 1 hour - Implementing Bucket Sort Exercise
Additional Resources
- A nice visualization of bucket sort: An interactive tool for visualizing bucket sort.
- A similar visualization for radix sort: An interactive tool for visualizing radix sort.
- Check out how radix sort is implemented: A GitHub repository showcasing the implementation of radix sort (Note: This won’t be covered in the lesson).
Internal resources
Find a 👾 bug 👾 or have suggestions? Let us know!