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

A)O(n)

B)O(log n)

C)O(1)

D)O(n log n)

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

A)O(n)

B)O(log n)

C)O(1)

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).