Sorting Algorithms - Divide and Conquer - Algorithms Part 4
This lecture dives into common sorting algorithms, including bubble sort, insertion sort, merge sort, and quick sort, explaining how divide and conquer can be used to develop optimal sorting algorithms. This is part 2 of our discussion on divide and conquer. We will conclude this section in the next video by discussing convolution and FFT.
Timestamps:
00:00 Introduction
00:20 Bubble Sort and Insertion Sort
02:16 Merge Sort
04:10 Quick Sort
06:33 Lower Bound on Sorting
08:10 Conclusion
#sorting #sortingalgorithms #divideandconquer #algorithms #bubblesort #insertionsort #mergesort #quicksort #recursion #recurrence #timecomplexity #computerscience