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

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.

he could use bold or bigger text just a suggestion.