Question 5: Professor Bond has developed the following algorithm that he claims is going to be a break through in computer science. Assuming array is zero indexed, A[0] is the first and A[n-1] is the last element, the algorithm is as follows: mystery Function (A, n) 1 2 { 3 4 9 10 11 12 13} int last Pos=n-1; while (last Pos > 0) { } int maxPos=0; for (int i=0; i <= lastPos; i++) if (A[i]> A[maxPos]) maxPos = i; swap (A, maxPos, last Pos); lastPos = lastPos 1; Given all of this, answer the following questions. (a) (b) (c) (d) Explain what the algorithm does in plain English. Why does the while loop in the algorithm's pseudocode iterate over all ele- (...) bound on the (...) bound on the ments but the last, rather than for all elements? What is the best-case of this algorithm? What is the running time of the best-case of this algorithm? What is the worst-case of this algorithm? What is the running time of the worst-case of this algorithm?
Question 5: Professor Bond has developed the following algorithm that he claims is going to be a break through in computer science. Assuming array is zero indexed, A[0] is the first and A[n-1] is the last element, the algorithm is as follows: mystery Function (A, n) 1 2 { 3 4 9 10 11 12 13} int last Pos=n-1; while (last Pos > 0) { } int maxPos=0; for (int i=0; i <= lastPos; i++) if (A[i]> A[maxPos]) maxPos = i; swap (A, maxPos, last Pos); lastPos = lastPos 1; Given all of this, answer the following questions. (a) (b) (c) (d) Explain what the algorithm does in plain English. Why does the while loop in the algorithm's pseudocode iterate over all ele- (...) bound on the (...) bound on the ments but the last, rather than for all elements? What is the best-case of this algorithm? What is the running time of the best-case of this algorithm? What is the worst-case of this algorithm? What is the running time of the worst-case of this algorithm?
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
![Question 5:
Professor Bond has developed the following algorithm that he claims is going to be a break
through in computer science.
1
23400 HER
2 {
6
7
8
9
10
11
Assuming array is zero indexed, A[0] is the first and A[n-1] is the last element, the algorithm
is as follows:
mystery Function (A, n)
12
13 }
int last Pos=n-1;
while (last Pos > 0)
{
}
int maxPos=0;
for (int i=0; i <= lastPos; i++)
if(A[i] > A[maxPos])
i;
maxPos =
swap (A, maxPos, lastPos);
last Pos
last Pos
- 1;
-
Given all of this, answer the following questions.
Explain what the algorithm does in plain English.
Why does the while loop in the algorithm's pseudocode iterate over all ele-
ments but the last, rather than for all elements?
(c)
(d)
What is the best-case of this algorithm? What is the (...) bound on the
running time of the best-case of this algorithm?
What is the worst-case of this algorithm? What is the (...) bound on the
running time of the worst-case of this algorithm?](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F474861d3-aaf1-4b4c-afe2-e250091335e4%2Feee0553b-94fc-485b-a5d1-5c91628128f7%2Fei1q9rl_processed.png&w=3840&q=75)
Transcribed Image Text:Question 5:
Professor Bond has developed the following algorithm that he claims is going to be a break
through in computer science.
1
23400 HER
2 {
6
7
8
9
10
11
Assuming array is zero indexed, A[0] is the first and A[n-1] is the last element, the algorithm
is as follows:
mystery Function (A, n)
12
13 }
int last Pos=n-1;
while (last Pos > 0)
{
}
int maxPos=0;
for (int i=0; i <= lastPos; i++)
if(A[i] > A[maxPos])
i;
maxPos =
swap (A, maxPos, lastPos);
last Pos
last Pos
- 1;
-
Given all of this, answer the following questions.
Explain what the algorithm does in plain English.
Why does the while loop in the algorithm's pseudocode iterate over all ele-
ments but the last, rather than for all elements?
(c)
(d)
What is the best-case of this algorithm? What is the (...) bound on the
running time of the best-case of this algorithm?
What is the worst-case of this algorithm? What is the (...) bound on the
running time of the worst-case of this algorithm?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 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