Question

Which sorting algorithm is best suited for a nearly sorted array, exhibiting O(

  • N time complexity in its best case?
A Selection Sort
B Merge Sort
C Insertion Sort
D Heap Sort
E Quick Sort
Practice Next

Hey! Ask a query