#DataStructure Time Complexity in Sorted Array.

Question

Given an sorted array in descending order, what will be the time complexity to delete the minimum element from this array?

Answer 1

Constant time. Because you directly know that the minimum element in an array sorted in decreasing order has to be the last element in the array.

Comments

@Lakshay Kakkar Therefore it's O(1)? we can directly go to last element/index in O(1) and delete it in O(1) time.

So, it's O(1) * O(1) = O(1)

is that what you mean?

---

See you don't need to do anything. Simply decrease the size of the sorted array by 1. Done.

---

yes, that will be reason. O(1) will be ans