ICC Data Structures and Algorithms 4

Question 1

Which sorting algorithm has a worst-case time complexity of O(n log n)?

Accepted Answer

Merge Sort

Answer

Merge Sort guarantees O(n log n) in all cases by repeatedly dividing and merging subarrays.

Question 2

What is the best-case time complexity of Bubble Sort?

Accepted Answer

O(n)

Answer

With an already-sorted array, Bubble Sort with an early-exit flag runs in O(n) — one pass with no swaps.

Question 3

Quick Sort selects a 'pivot' element and then:

Accepted Answer

Partitions elements into those less than and greater than the pivot

Answer

Quick Sort partitions the array around the pivot so all smaller elements are on the left and larger ones on the right.

Question 4

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

Accepted Answer

Radix Sort

Answer

Radix Sort distributes elements into buckets by digit value, bypassing direct element comparisons.

Question 5

Insertion Sort is most efficient when the input data is:

Accepted Answer

Nearly sorted

Answer

Nearly sorted input minimizes the number of shifts required, making Insertion Sort approach O(n) performance.

(ICC) International Code Council Practice Test