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
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
Related questions
Question
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:](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbad9eda7-57c9-475e-b126-0f24ea0e5433%2Fb1691b0b-5353-48f3-aaf5-15a401662552%2Fk34j5s_processed.jpeg&w=3840&q=75)
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.
Step by step
Solved in 2 steps
Knowledge Booster
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
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education