You are given an unsorted array A[1, ..., n]. We know that the maximum (or minimum) element in the array can be found in (n-1) comparisons. Write an algorithm that finds both the maximum and the minimum element in the array in ~(3n/2) comparisons, i.e., (3n/2) + THETA(1) comparisons.

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter8: Arrays And Strings
Section: Chapter Questions
Problem 24PE
icon
Related questions
Question

You are given an unsorted array A[1, ..., n].
We know that the maximum (or minimum) element in the array can be found in (n-1) comparisons.
Write an algorithm that finds both the maximum and the minimum element in the array in ~(3n/2) comparisons, i.e., (3n/2) + THETA(1) comparisons.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Counting Sort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning