Chapter 2 h Algorithm Discovery and Design FIGURE 2.14 Get a value for n, the size of the list Get values for A, A,.., A, the list to be searched Set the value of largest so far to A, Set the value of location to 1 Set the value of i to 2 While (is n) do If A, > largest so far then Set largest so far to A, Set location to i Add 1 to the value of i End of the loop Print out the values of largest so far and location Stop Algorithm to find the largest value in a list

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
icon
Related questions
Question
100%

Develop Pseudo-code (English-like) for: 

 

In the Find Largest pseudo-code algorithm of Figure 2.14, listed below, if the numbers in our list were not unique and therefore the largest number could occur more than once. Modify the algorithm below to find all the occurrences of the largest number and their position in the list.

Chapter 2 h Algorithm Discovery and Design
FIGURE 2.14
Get a value for n, the size of the list
Get values for A, A,.., A, the list to be searched
Set the value of largest so far to A,
Set the value of location to 1
Set the value of i to 2
While (is n) do
If A, > largest so far then
Set largest so far to A,
Set location to i
Add 1 to the value of i
End of the loop
Print out the values of largest so far and location
Stop
Algorithm to find the largest value in a list
Transcribed Image Text:Chapter 2 h Algorithm Discovery and Design FIGURE 2.14 Get a value for n, the size of the list Get values for A, A,.., A, the list to be searched Set the value of largest so far to A, Set the value of location to 1 Set the value of i to 2 While (is n) do If A, > largest so far then Set largest so far to A, Set location to i Add 1 to the value of i End of the loop Print out the values of largest so far and location Stop Algorithm to find the largest value in a list
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

Output: are you using random numbers? can any sequence of numbers be used?

Solution
Bartleby Expert
SEE SOLUTION
Follow-up Question

Is this algorithm intended to be put into Python??

Solution
Bartleby Expert
SEE SOLUTION
Follow-up Question

If the numbers in our list were not unique and therefore the largest number could occur more than once, would the algorithm find each occurrence?

Solution
Bartleby Expert
SEE SOLUTION
Follow-up Question

 If the numbers in our list were not unique and therefore the largest number could occur more than once, would the algorithm find the first occurrence?

Solution
Bartleby Expert
SEE SOLUTION
Knowledge Booster
Computational Systems
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
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