Software-testing
April 28, 2024Question 4464 – Data-Interpretation
April 28, 2024GATE 2006
| Question 17 |
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 θ(nlogn) | |
| Solves it in time θ(n2) |
Question 17 Explanation:
Solves it in linear time using a right to left pass of the array will takes time complexity is O(n).
Correct Answer: B
Question 17 Explanation:
Solves it in linear time using a right to left pass of the array will takes time complexity is O(n).