Which is a con to using merge sort Select all that apply The

Which is a con to using merge sort? Select all that apply. There may be multiple answers.

  
A) Selecting a poor choice for the pivot will hinder the algorithm\'s performance.

  
B) The merge operation causes it to always be slower than quicksort.

  
C) It requires a second array, the same size as the input, to be created.

  
D) It requires more RAM than the other algorithms covered in class.

Solution

Answer:

A) Selecting a poor choice for the pivot will hinder the algorithm\'s performance.

and

C) It requires a second array, the same size as the input, to be created.