An element in an array X is called the leader if it is the middle element in the sorted array. The best algorithm to find the leader in any array :
A) Takes Linear time using Median of medians.
B) Takes O(nlogn) using Merge Sort
C) Takes O(n2) using Linear Search
D) Takes O(logn) using Binary Search
