Lecture Outline

• We will be writing our own sorting algorithms. Today's lecture focuses on Bubble sort
• Bubble sort runs in O(n^2) time (n = array size). This is because we have a for loop inside of a for loop

Lecture Recording

• https://youtu.be/F-8vPJHfozM

Lecture Slides

• Sorting (Bubble Sort and Selection Sort)

Code

• SortingAlgorithmsDemo
• SortingAlgorithms

Click here to return to the course schedule