Lesson 6 of 9 • 0 upvotes • 10:06mins
Inplace Sorting method don't need any significant extra space to carry out the sorting process like in Quick Sort, whereas Non-inplace sorting methods need extra space equal to input size to achieve sorting like in Merge Sort. If relative order of similar elements is same in unsorted & sorted list, it is known as Stable Sorting. Merge Sort is stable whereas Quick Sort is not stable. Finally Comparison of Merge Sort & Quick Sort can be done on various parameters as described in lesson. Congrats, you just finished the Merge Sort & Quick Sort :)
9 lessons • 1h 36m
Introduction to the Course and Basic Terminologies
6:21mins
Asymptotic Notations, Introduction to Merge Sort Algorithm
7:42mins
Merge Algorithm, Time and Space Complexity of Merge Sort
14:21mins
Quick Sort Algorithm
14:46mins
Time and Space Complexity Analysis of Quick Sort
10:24mins
Extra Topics and Comparison between Merge Sort and Quick Sort
10:06mins
Bubble Sort Algorithm
8:39mins
Selection Sort Algorithm
9:57mins
Insertion Sort Algorithm
14:01mins