Which of the following sorting techniques is most efficient if the range of input data is not significantly greater than a number of elements to be sorted?
A. selection sort
B. bubble sort
C. counting sort
D. insertion sort
Answer: Option C
A. selection sort
B. bubble sort
C. counting sort
D. insertion sort
Answer: Option C
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