Computer scienceAlgorithms and Data StructuresAlgorithmsArray algorithmsSorting algorithms

Counting sort

What does it do?

Report a typo

You need to choose only correct statements about counting sort.

Select one or more options from the list

The time complexity is not better than O(n log n).

It requires additional memory to store an array containing counts of elements in the input array.

It doesn't compare array elements at all.

It cannot be stable.

___

Create a free account to access the full topic