Time complexity of insertion sort algorithm in the best case is

1.2. Time complexity of insertion sort algorithm in the best case is
A) O(n)
B) O(n log2 n)
C) O(n2)
D) none of the above

Leave a Reply