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 nested for loop
• Bubble sort involves comparing pairs of adjacent values, and swapping. This causes large numbers ("bubbles") to rise to the top

Lecture Recording

• https://youtu.be/dEK46gcR7VQ

Lecture Slides

• Sorting (Bubble Sort and Selection Sort)

Code

• SortingAlgorithmDemo
• SortingAlgorithm

Click here to return to the course schedule