Awesome q2a theme
0 votes

Consider the problem of computing min-max in an unsorted array where min and max are minimum and maximum elements of an array. Algorithm A1 can compute min-max in a1 comparisons using 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?

  1. a1 < a2.
  2. a2 > a1.
  3. a1 = a2.
  4. Depends on the input.
in Algorithms by (22 points) | 2 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Jun 2020
  1. vps123

    4 Points

  2. ummokkate

    1 Points

  3. Kushagra गुप्ता

    1 Points

  4. faseela45

    1 Points

  5. srestha

    1 Points

7,385 questions
1,744 answers
90,357 users