engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
Which of the following is the recurrence relation for insertion sort?
1
T(n) = T(n-1) + O(n)
2
T(n) = T(n/2) + O(n)
3
T(n) = T(n2) + O(log n)
4
T(n) = T(n2) + O(n log n)