Which of the following sorting algorithms is the fastest when sorting a large array
A)Selection sort
B)Insertion sort
C)Merge sort
D)They all run at roughly the same speed

Question

Quizplus · Accepted Answer

Merge sort has a time complexity of O(nlogn) which makes it the fastest sorting algorithm for large arrays. Selection sort and Insertion sort have time complexities of O(n^2), which makes them inefficient for large arrays.

Which of the Following Sorting Algorithms Is the Fastest When