Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Consider the following algorithm: ср ALGORITHM Secret(A[0..n â^' 1]) //Input: An array A[0..n â^' 1] of n real numbers minval <- A[0] maxval <- A[0] for i <- 1 to n - 1 do if A[i]< minval minval <- A[i]

Consider the following algorithm: ср ALGORITHM Secret(A[0..n â^' 1]) //Input: An array A[0..n â^' 1] of n real numbers minval <- A[0] maxval <- A[0] for i <- 1 to n - 1 do if A[i]< minval minval <- A[i]

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
## Format Requirement Algorithms in pseudo code **MUST** be placed in code blocks/fences, and use highlighter. Algorithms should follow the pseudo code standard described in *Pseudocode Handout*. срр as the syntax Do NOT change the template except the answer portion. Formulas and equations should be in math mode using Latex math symbols. - Markdown math tutorial: http://tug.ctan.org/info/undergradmath/undergradmat h.pdf Two ways to enter math mode: Insert a pair of dollar signs: \$your equations go here\$. This is the inline math mode. *Notice that there is no space between the \$ and the letter*. Insert a pair of double-dollar signs: \$\ $ your equations go here \$\$, which produces a standalone equation/formula set.
Transcribed Image Text:## Format Requirement Algorithms in pseudo code **MUST** be placed in code blocks/fences, and use highlighter. Algorithms should follow the pseudo code standard described in *Pseudocode Handout*. срр as the syntax Do NOT change the template except the answer portion. Formulas and equations should be in math mode using Latex math symbols. - Markdown math tutorial: http://tug.ctan.org/info/undergradmath/undergradmat h.pdf Two ways to enter math mode: Insert a pair of dollar signs: \$your equations go here\$. This is the inline math mode. *Notice that there is no space between the \$ and the letter*. Insert a pair of double-dollar signs: \$\ $ your equations go here \$\$, which produces a standalone equation/formula set.
Consider the following algorithm: срр ALGORITHM Secret (A[0..n â^' 1]) 7/Input: An array A[0..n â^' 1] of n real numbers minval <- A[0] maxval <- A[0] for i <- 1 to n - 1 do if A[i]< minval minval <- A[i] if A[i]> maxval maxval <- A[i] return maxval â^' minval 1. What does this algorithm compute? 2. What is its basic operation? 3. How many times is the basic operation executed? 4. What is the efficiency class of this algorithm? 5. Suggest an improvement, or a better algorithm altogether, and indicate its efficiency class. If you cannot do it, try to prove that. #### Answer:
Transcribed Image Text:Consider the following algorithm: срр ALGORITHM Secret (A[0..n â^' 1]) 7/Input: An array A[0..n â^' 1] of n real numbers minval <- A[0] maxval <- A[0] for i <- 1 to n - 1 do if A[i]< minval minval <- A[i] if A[i]> maxval maxval <- A[i] return maxval â^' minval 1. What does this algorithm compute? 2. What is its basic operation? 3. How many times is the basic operation executed? 4. What is the efficiency class of this algorithm? 5. Suggest an improvement, or a better algorithm altogether, and indicate its efficiency class. If you cannot do it, try to prove that. #### Answer:
Expert Solution
Step 1

Given :-

1. What does this algorithm compute?
2. What is its basic operation?
3. How many times is the basic operation executed?
4. What is the efficiency class of this algorithm?

5. Suggest an improvement, or a better algorithm
altogether, and indicate its efficiency class. If
you cannot do it, try to prove that.

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
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.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS