Which of the following statements are true about quick sort

A. It can degrade into an O (n2) sort if the pivot selection scheme is bad

B. It doesnt require additional memory that merges sort does

C. All other answers

D. in practice it can be transfer than merge sort

Question

Lance Campbell

Computers & Technology

6 December, 04:30

Which of the following statements are true about quick sort

A. It can degrade into an O (n2) sort if the pivot selection scheme is bad

B. It doesnt require additional memory that merges sort does

C. All other answers

D. in practice it can be transfer than merge sort

+5

Answers (1)

Know the Answer?

Sarahi Pratt · Answer 1

C. All Other Answers.

Explanation:

Worst case time complexity of quick sort is O (n²) if it selects always the smallest or the largest number in the array it can be optimized by always selecting the right pivot. Since quicksort is inplace it does not require additional memory to sort the array. Quick sort is considered better than merge sort in cases of arrays.

Which of the following statements are true about quick sortA. It can degrade into an O (n2) sort if the pivot selection scheme is badB. It doesnt require additional memory that merges sort doesC. All other answersD. in practice it can be transfer than merge sort

Which of the following statements are true about quick sort

A. It can degrade into an O (n2) sort if the pivot selection scheme is bad

B. It doesnt require additional memory that merges sort does

C. All other answers

D. in practice it can be transfer than merge sort