best case complexity

Question

Which of the following sorting algorithms has/have minimum running time complexity in best case?

I. Selection Sort

II. Insertion Sort

---

a. I

b. II

c. Both have same minimum running time complexity

Answer 1

Insertion sort has  minimum running time complexity O(n) in best case i.e when the array is already sorted.

Worst case time complexity of insertion sort =O($n^{2}$ )and selection sort is also O($n^{2}$)

Ans:B)

Answer 2

B insertion sort