- Courses
- Tutorials
- Practice
- Contests
Data Structure
Java
Python
HTML
Interview Preparation
GATE | GATE MOCK 2017 | Question 37
Last Updated :
Discuss
Comments
Consider the problem of computing min-max in an unsorted array where min and max are minimum and maximum elements of array. Algorithm A1 can compute min-max in a1 comparisons without divide and conquer. Algorithm A2 can compute min-max in a2 comparisons by scanning the array linearly. What could be the relation between a1 and a2 considering the worst case scenarios?
a1 < a2
a1 > a2
a1 = a2
Depends on the input
This question is part of this quiz :
Top MCQs on Divide and Conquer Algorithm with Answers,GATE 2017 MockShare your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy