Time Complexity of this Question


#1

Note that time complexity is O(N) and not O(LOGN) because we are at max at each iteration calling two recursive calls.