Sorting Algorithms · Merge Sort and Quicksort in Python: Pivot Choice and Worst Cases
Question 1 of 5
Two sorted lists, [1, 4, 9] and [2, 3, 10, 11], are merged by comparing the two front items each time. How many comparisons happen before the rest is simply copied?
Tip: press 1-4 to answer, Enter to continue. Finish the quiz to bank your XP.