Time complexity.......1


What is the efficient asymptotic running time to find the median of the sorted array of size N?

B)O(log n)
D)O(n log n)


Correct Option is C
If array is odd sized pick the middle one element . If even, pick the two middle most and average.
And this can be done in constant number of steps, so O(1).


c is the correct answere