Time complexity

Question

Consider the array of size n. the first (n – 1) elements are already sorted. What is the worst case time complexity to insert a nth element in an array after insertion the array should be in sorted order??

Comments

Insertion sort O(n). But location can be find in O(logn)

Answer 1

O(n) as it will take logn time to find the place of the value and in worst case O(n) time to insert the value.