APPSC-2016-DL-CS
March 14, 2024Question 10837 – APPSC-2016-DL-CS
March 14, 2024Question 10830 – APPSC-2016-DL-CS
The best case time complexity of insertion sort algorithms is ______
Correct Answer: A
Question 28 Explanation:
The best case of insertion sort is when all the elements given in array are already sorted. In that case when insertion sort is applied only one comparison is made for each element of the array. Hence if we have n-elements the n-comparisons will be made. Hence the time complexity will be O(n)
O(n)
O(1)
O(n2)
O(n log n)