# a) Describe, using English, an algorithm for finding the

## Problem 2RQ Chapter 3.R

Discrete Mathematics and Its Applications | 7th Edition

• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants

Discrete Mathematics and Its Applications | 7th Edition

4 5 0 317 Reviews
13
1
Problem 2RQ

a) Describe, using English, an algorithm for finding the largest integer in a list of n integers.________________b) Express this algorithm in pseudocode.________________c) How many comparisons does the algorithm use?

Step-by-Step Solution:

Solution: Step 1 :In this problem we have using english to explain an algorithm for finding the largest integer in a list of n integers.Step 2 : (a) :* first step we have to set the temporary maximum equal to the first integer in the sequence.* The temporary maximum will be the largest integer examined at any stage of the program.* Next we have to compare the next integer in the sequence to the temporary maximum.* And then set the temporary maximum equal to this integer.* Repeat above all steps if there are more integers in the sequence. * Otherwise stop when there are no integers left in the sequence.* The temporary maximum at this point is the largest integer in the sequence.

Step 3 of 4

Step 4 of 4

##### ISBN: 9780073383095

Since the solution to 2RQ from 3.R chapter was answered, more than 231 students have viewed the full step-by-step answer. The full step-by-step solution to problem: 2RQ from chapter: 3.R was answered by , our top Math solution expert on 06/21/17, 07:45AM. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7th. This full solution covers the following key subjects: Algorithm, Integer, describe, english, express. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. The answer to “a) Describe, using English, an algorithm for finding the largest integer in a list of n integers.________________b) Express this algorithm in pseudocode.________________c) How many comparisons does the algorithm use?” is broken down into a number of easy to follow steps, and 29 words. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095.

#### Related chapters

×
Get Full Access to Discrete Mathematics And Its Applications - 7th Edition - Chapter 3.r - Problem 2rq

Get Full Access to Discrete Mathematics And Its Applications - 7th Edition - Chapter 3.r - Problem 2rq

I don't want to reset my password

Need help? Contact support

Need an Account? Is not associated with an account
We're here to help