Lecture Outline

• Quick Sort is a sorting algorithm that works by partitioning an array around a certain element in the array, called a pivot. This is a recursive method that then sorts the sections of the array to the left of the pivot, and to the right of the pivot.
• Just like merge sort, quick sort is a divide and conquer algorithm
• Worst case scenario: Quick sort runs in O(n^2), but on average runs in O(nlogn) time

Lecture Recording

• https://youtu.be/3MWfXmx4hjk

Lecture Slides

• Quick Sort

Code

• SortingAlgorithmsDemo
• SortingAlgorithms

Click here to return to the course schedule