Multiple choice

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

Solves it in linear time using a left to right pass of the array
Solves it in linear time using a right to left pass of the array
Solves it using divide and conquer in time O(n log n)
Solves it in time O(n²)

Reveal answer Fill a bubble to check yourself