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 worst case?

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

What is the primary disadvantage of Counting Sort?

It is not stable
It requires additional memory
It is inefficient for small datasets
It has a high time complexity

What happens during the counting phase in Counting Sort?

Elements are swapped within subarrays
The frequency of each element is recorded
The largest element is placed in the correct position
No comparisons are made

What is the space complexity of Counting Sort?

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

Virtual Labs

Counting Sort Posttest

Answer the multiple-choice questions below to test your understanding!

Multiple-Choice Questions:

Virtual Labs

Counting Sort Posttest

Answer the multiple-choice questions below to test your understanding!

Multiple-Choice Questions:

Rate

Bug Report