Question

which of the following sorting algorithms would be the best to use given an array of over one million values?

Answer 1

The Quick sort is best suited to sort the array of 1 million values.

Step-by-step explanation:

Quick sort's practical applications employ the randomized variant. In reality, randomized Quick Sort algorithms nearly never exhibit worst-case behavior and are O. And Fast sort has strong cache locality and uses minimal extra capacity.