Chapter 3: Q1E (page 202)
List all the steps used by algorithm 1 to find the maximum of the list
1, 8, 12, 9, 11, 2, 14, 5, 10, 4
The maximum of 1, 8, 12, 9, 11, 2, 14, 5, 10, 4 is 14.
Over 22 million students worldwide already upgrade their learning with Vaia!
All the tools & learning materials you need for study success - in one app.
Get started for free
Describe an algorithm that will count the number of 1s in a bit string by examining each bit of the string to determine whether it is a 1 bit.
Show all the steps used by the binary insertion sort to sort the list 3, 2, 4, 5, 1, 6.
a) Describe, using English, an algorithm for finding the largest integer in a list ofnintegers.
b.) Express this algorithm in pseudocode.
c.) How many comparisons does the algorithm use?
Describe an algorithm that produces the maximum, median, mean, and minimum of a set of three integers. (The median of a set of integers is the middle element in the list when these integers are listed in order of increasing size. The mean of a set of integers is the sum of the integers divided by the number of integers in the set.
How many comparisons does the insertion sort use to sort the list n, n – 1,…, 2, 1?
The binary insertion sort is a variation of the insertion sort that uses a binary search technique (see Exercise 44) rather than a linear search technique to insert the element in the correct place among the previously sorted elements.
What do you think about this solution?
We value your feedback to improve our textbook solutions.
