Q17

MCQ1 mark, −0.25

An element in an array $X$ is called a leader if it is greater than all elements to the right of it in $X$ . The best algorithm to find all leaders in an array

(A)

solves it in linear time using a left to right pass of the array

(B)

solves it in linear time using a right to left pass of the array

(C)

solves it using divide and conquer in time $\Theta (n\log n)$

(D)

solves it in time $\Theta( n^2)$

Loading…