Nothing here yet.
Nothing here yet.
Hello Arjun, Time Complexity is more about how things scale with increasing input size and not about the cost of each iteration. A complexity of O(logn) would simply mean that if the length of the input array is doubled, the effort involved is about 30% more than that of the original input. This stack overflow answer explains it beautifully.