Computer scienceProgramming languagesJavaInterview preparationAlgorithms and problem solving techniques

Sorting algorithm problem in action

Counting sorting

Report a typo

Choose the correct statement about the counting sorting algorithm.

Select one or more options from the list

This is a comparison-based sorting algorithm

The memory requirement of the algorithm is O(1)

The time complexity of the algorithm is O(n+k)

The memory requirement of the algorithm is O(n+k)

The time complexity of the algorithm is O(n^2)

This is a non-comparison-based sorting algorithm

___

Create a free account to access the full topic