Virtual Labs

What is the primary strategy used in Counting Sort?

Counting the frequency of elements
Swapping adjacent elements
Dividing the array into subarrays
Building a heap structure

What is the time complexity of Counting Sort in the best case?

O(n²)
O(n log n)
O(n + k)
O(log n)

What is the key disadvantage of Counting Sort?

It is not efficient for large datasets
It requires additional memory
It is not stable
It is inefficient for small datasets

What happens during the counting phase in Counting Sort?

The frequency of each element is recorded
Elements are merged
Adjacent elements are swapped
The largest element is placed in the correct position

What is the space complexity of Counting Sort?

O(n)
O(k)
O(n + k)
O(1)

Counting Sort Pretest