Which of the following is false?
A. Binary tree sort and quick sort have same running time
B. Binary tree sort used BST as work area
C. As the number of elements to sort gets larger, binary tree sort gets more and more efficient
D. Both quick sort and binary tree are in place sorting algorithms
Answer: Option D
This Question Belongs to Data Structure >> Sorting Algorithms
Related Questions on 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