MCQ Bank

The two main phases of heapsort are:

The time complexity of building a binary heap from an unsorted array of n elements is:

The partition step of quicksort rearranges elements so that:

Bucket sort achieves linear average-case time by:

Shell sort improves on insertion sort by:

A stable sorting algorithm preserves the relative order of elements that have:

Radix sort sorts numbers by processing:

Counting sort runs in linear time when the range of input values k is:

The best-case time complexity of bubble sort with an early-exit optimization on already-sorted data is:

Insertion sort performs best (near linear time) when the input is:

Which sorting algorithm repeatedly selects the smallest remaining element and places it in order?

Heapsort achieves its ordering by first building a heap and then repeatedly:

What is the worst-case time complexity of the quicksort algorithm?

Any comparison-based sorting algorithm has a lower bound on worst-case comparisons of:

What is the average-case time complexity of the quicksort algorithm?

Which of the following sorting algorithms is NOT comparison-based?

Merge sort has a guaranteed worst-case time complexity of: