← Back to Data Structures & Algorithms
Sorting quiz
Five questions on Sorting. Answer all 5 to see your score. Questions are drawn from a bank of 15, so every attempt is different.
Question 1 of 5
A sort is stable if:
Question 2 of 5
Bubble sort with an early-exit check on already sorted input takes:
Question 3 of 5
Selection sort always performs about how many comparisons?
Question 4 of 5
Insertion sort's running time is O(n + I), where I is the number of:
Question 5 of 5
A reversed array of 5 items has how many inversions?