Which of the following statement is true about comparison based sorting...

Home / Data Structure / Sorting Algorithms / Question

Examveda

Which of the following statement is true about comparison based sorting?

A. counting sort is a comparison based sort

B. any comparison based sorting can be made stable

C. bubble sort is not a comparison based sort

D. any comparison based sort requires at least O(n²) time

Answer: Option B

This Question Belongs to Data Structure >> Sorting Algorithms

Related Questions on Sorting Algorithms

A. O(n log n)

B. O(n)

C. O(n²)

D. O(n³)

View Answer

A. Insertion Sort

B. Quick Sort

C. Selection Sort

D. Insertion Sort

View Answer

A. O(n²)

B. O(1)

C. O(n)

D. O(log n)

View Answer

A. Merge Sort

B. Heap Sort

C. Counting Sort

D. Quick Sort

View Answer