Please Login To Continue

Extra Topics and Comparison between Merge Sort and Quick Sort

Lesson 6 of 9 • 0 upvotes • 10:06mins

Avatar

Ayushman Tiwari

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 :)

Continue on app
1

Introduction to the Course and Basic Terminologies

6:21mins

2

Asymptotic Notations, Introduction to Merge Sort Algorithm

7:42mins

3

Merge Algorithm, Time and Space Complexity of Merge Sort

14:21mins

4

Quick Sort Algorithm

14:46mins

5

Time and Space Complexity Analysis of Quick Sort

10:24mins

6

Extra Topics and Comparison between Merge Sort and Quick Sort

10:06mins

7

Bubble Sort Algorithm

8:39mins

8

Selection Sort Algorithm

9:57mins

9

Insertion Sort Algorithm

14:01mins

Crack CBSE Class 12 with Unacademy

Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Structured syllabus
Daily live classes
Daily live classes
Ask doubts
Ask doubts
Tests & practice
Tests & practice

Similar Plus Courses

thumbnail
ENROLL
HinglishVARC

Course on Language CUET

Nikita Singh

Unacademy is India’s largest online learning platform. Download our apps to start learning


Starting your preparation?

Call us and we will answer all your questions about learning on Unacademy

Call +91 8585858585
Company
About usShikshodayaCareersBlogsPrivacy PolicyTerms and Conditions
Products
Learner appLearner appEducator appEducator appParent appParent app