Overview
This lesson is an introduction to the concept of sorting in computer science, including sorting methods, stability, and how Big O comes into play for sorting.
Prerequisites
- Big O Notation
Learning Objectives
By the end of this module, learners will be able to:
- Define the two sorting methods and when you’d use each.
- Identify whether a sort is stable or unstable, and what impact that can have.
- Explain how Big O complexity applies to sorting algorithms.
Content
There are two components to this module:
- Lesson: Intro to Sorting Algorithms
- Exercise: My First Sorts
Time to Complete
1.5 hours total:
- 0.5 hour - Intro to Sorting Algorithms Lesson
- 1 hour - My First Sort Exercise
Additional Resources
- Review the most common types of sorting-related interview questions: A collection of common sorting-related interview questions.
Internal resources
Find a 👾 bug 👾 or have suggestions? Let us know!