Friday December 1st 2023

Lecture Outline

Binary Search can be implemented using recursion
insertion sort is a commonly-seen sorting algorithm where the array is divided into two sections: a sorted section and an unsorted section. Each iteration, we take an element from the unsorted section, and move it to the sorted section
Running time of insertion sort is O(n^2)
Shell Sort, and Cocktail Shaker sort are also sorting algorithms, and run in O(n^2) time
15 Sorting Algorithms in 6 minutes: https://www.youtube.com/watch?v=kPRA0W1kECg&ab_channel=TimoBingmann