A. counting sort has large time complexity
B. counting sort has large space complexity
C. counting sort is not a comparison based sorting technique
D. counting sort cannot be used for array with non integer elements
Answer: Option D
This Question Belongs to Data Structure >> Sorting Algorithms
What is the time complexity of Bubble Sort in the average case?
A. O(n log n)
B. O(n)
C. O(n2)
D. O(n3)
Which sorting algorithm is based on the divide-and-conquer strategy?
A. Insertion Sort
B. Quick Sort
C. Selection Sort
D. Insertion Sort
Which sorting algorithm uses a "pivot" element to partition the array into sub-arrays?
A. Merge Sort
B. Heap Sort
C. Counting Sort
D. Quick Sort
Join The Discussion