×

Log in to StudySoup

Discrete Mathematics And Its Applications - 7 Edition - Chapter 3.1 - Problem 1e
Forgot password?
Register Now
×

Join StudySoup

Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 3.1 - Problem 1e
Already have an account? Login here
×
Reset your password

Solutions for Discrete Mathematics and Its Applications | 7th Edition | ISBN: 9780073383095 | Authors: Kenneth Rosen 9780073383095

Solution for problem 1E Chapter 3.1

List all the steps used by Algorithm I to find the maximum

Discrete Mathematics and Its Applications | 7th Edition


Problem 1E

List all the steps used by Algorithm I to find the maximum of the list 1, 8, 12, 9. 11, 2, 14, 5, 10, 4.

Accepted Solution
Step-by-Step Solution:

Solution:Step 1In this problem we have to list all the steps used by algorithm 1 to find maximum of the list 1, 8, 12, 9. 11, 2, 14, 5, 10, 4.Using algorithm 1Steps would be 1. Work on first element of given array in variable max.2. Compare max with the next element of array3. If nest element is greater then max will be replaced by this number.4. Repeat steps 2 and third till end of the array is reached.

Chapter 3.1, Problem 1E is Solved

Step 2 of 3


Step 3 of 3

Unlock Textbook Solution

Enter your email below to unlock your verified solution to:

List all the steps used by Algorithm I to find the maximum