Skip to main content

Intro to Sorting Algorithms

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.

There are two components to this lesson:

  1. myGA module: Intro to Sorting Algorithms
    • If the above link does not take you to the correct module, you can find the lesson in your myGA dashboard.
  2. In-Class Exercise: My First Sort

Learning Objectives​

By the end of this lesson, you 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.

Prerequisites​

  • Big O Notation

Duration​

1.5 hours total:

  • 0.5 hour myGA
  • 1 hour in class

Additional Reading​