Scenarios
Merge vs Quick
Insertion vs Selection
100
If there's a large data set, which method would be the most efficient/preferred?
Merge Sort
100
What do both methods do when sorting a list?
Split the array/list
100
What do both methods do when sorting?
Split the list into two sections: sorted and unsorted.
200
If the list is almost sorted, which method is the most efficient?
Insertion
200
Which one of the following is merge sort?
200
Which one is selection sort?
300
If there is limited memory, which method is the worst choice?
Merge Sort
300
Complete the blank: Merge and quick sort are also _________ methods.
Recursive
300
Do the two always have the same complexity? If not, in which scenario do they differ?
No. When a list is already sorted insertion has a time complexity of O(n) while selection has a complexity of O(n^2).
400
For most cases, which method is the fastest?
Quick sort
400
Which one(s) are stable?
Merge Sort
400
Describe the main difference between the two methods.
Selection continuously finds the minimum value of the unsorted section and adds it to the end sorted section while insertion adds values from the unsorted section into their correct spot in the sorted section.
500
If you need to sort a small list where relative order matters, which method is the most appropriate?
Insertion
500
Which one is faster in their worst case scenarios?
Merge sort. Quick sort has a time complexity of O(n^2) in the worst case scenario where as merge sort's is O(n*log n).
500
Which one(s) are stable?
Insertion