Question

If the array is already sorted,
which of these algorithms will
exhibit the best performance?
O Bubble sort
O Insertion Sort
O Quick Sort
Selection Sort​

Answer 1

Explanation:

the best case

O(n) or O(n log n)

so the above is similar but merge sort is best