Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)
3rd Edition
ISBN: 9780134689555
Author: Edgar Goodaire, Michael Parmenter
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 8, Problem 12RE
Sort the list 9,-3,1,0,-4,5,3 into increasing order
with a bubble sort;
with a merge sort
In each case, how many comparisons are needed?
(For the merge sort, ignore comparisons required to check the size and parity of n at each iteration of Step 3.)
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Determine how many rows are in the corner section of a stadium containing 3920 seats if the first row has 10 seats and each successive row has 6 additional seats?
The following table shows the number of employees in the four divisions of a corporation. There are 85 new computers that are to be apportioned among the divisions based on the number of employees in each division.
In the provided table, the education information and incomes of 73,736 people are given. The rows are labeled with education status and the columns are labeled with income range.
The total of all entries in each row gives the total number of people with the corresponding education status and similarly, the total of all entries of a particular column gives the number of people with the corresponding income range.
Please answer subpart 4 and 5.
Chapter 8 Solutions
Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)
Ch. 8.1 - Prob. 1TFQCh. 8.1 - Prob. 2TFQCh. 8.1 - Prob. 3TFQCh. 8.1 - Prob. 4TFQCh. 8.1 - Prob. 5TFQCh. 8.1 - Prob. 6TFQCh. 8.1 - Prob. 7TFQCh. 8.1 - Prob. 8TFQCh. 8.1 - Prob. 9TFQCh. 8.1 - Prob. 10TFQ
Ch. 8.1 - Prob. 1ECh. 8.1 - Prob. 2ECh. 8.1 - Prob. 3ECh. 8.1 - Prob. 4ECh. 8.1 - Prob. 5ECh. 8.1 - Prob. 6ECh. 8.1 - Prob. 7ECh. 8.1 - Prob. 8ECh. 8.1 - Prob. 9ECh. 8.1 - Prob. 10ECh. 8.1 - Prob. 11ECh. 8.1 - Prob. 12ECh. 8.1 - Prob. 13ECh. 8.1 - Prob. 14ECh. 8.1 - Prob. 15ECh. 8.1 - Prob. 16ECh. 8.1 - Prob. 17ECh. 8.1 - Prob. 18ECh. 8.1 - Prob. 19ECh. 8.1 - Prob. 20ECh. 8.2 - Prob. 1TFQCh. 8.2 - Prob. 2TFQCh. 8.2 - Prob. 3TFQCh. 8.2 - Prob. 4TFQCh. 8.2 - Prob. 5TFQCh. 8.2 - Prob. 6TFQCh. 8.2 - Prob. 7TFQCh. 8.2 - Prob. 8TFQCh. 8.2 - Prob. 9TFQCh. 8.2 - Prob. 10TFQCh. 8.2 - Prob. 1ECh. 8.2 - Prob. 2ECh. 8.2 - Prob. 3ECh. 8.2 - 4. Find an algorithm for finding the smallest...Ch. 8.2 - Prob. 5ECh. 8.2 - 6. (a) [BB] Justify the statement made in...Ch. 8.2 - Prob. 7ECh. 8.2 - Prob. 8ECh. 8.2 - Prob. 9ECh. 8.2 - Prob. 10ECh. 8.2 - Prob. 11ECh. 8.2 - Prob. 12ECh. 8.2 - Prob. 13ECh. 8.2 - Prob. 14ECh. 8.2 - Prob. 15ECh. 8.2 - Prob. 16ECh. 8.2 - Prob. 17ECh. 8.2 - Prob. 18ECh. 8.2 - Prob. 19ECh. 8.2 - Prob. 20ECh. 8.2 - Prob. 21ECh. 8.2 - Prob. 22ECh. 8.2 - Prob. 23ECh. 8.2 - Prob. 24ECh. 8.2 - Prob. 25ECh. 8.2 - The Russian peasant method is used to multiply two...Ch. 8.2 - Prob. 27ECh. 8.2 - Prob. 28ECh. 8.3 - Prob. 1TFQCh. 8.3 - Prob. 2TFQCh. 8.3 - (Answers can be found in the back of the book.)...Ch. 8.3 - Prob. 4TFQCh. 8.3 - Prob. 5TFQCh. 8.3 - (Answers can be found in the back of the book.)
6....Ch. 8.3 - Prob. 7TFQCh. 8.3 - Prob. 8TFQCh. 8.3 - Prob. 9TFQCh. 8.3 - Prob. 10TFQCh. 8.3 - Prob. 1ECh. 8.3 - Prob. 2ECh. 8.3 - Describe a ternary search algorithm, which...Ch. 8.3 - Prob. 4ECh. 8.3 - Prob. 5ECh. 8.3 - Prob. 6ECh. 8.3 - Prob. 7ECh. 8.3 - Prob. 8ECh. 8.3 - Prob. 9ECh. 8.3 - Prob. 10ECh. 8.3 - Prob. 11ECh. 8.3 - Prob. 12ECh. 8.3 - Prob. 13ECh. 8.3 - Prob. 14ECh. 8.3 - Prob. 15ECh. 8.3 - Prob. 16ECh. 8.3 - Prob. 17ECh. 8.3 - [BB] Show the steps involved in the application of...Ch. 8.3 - Prob. 19ECh. 8.3 - The Binary search Algorithm we have presented...Ch. 8.3 - Prob. 21ECh. 8.3 - Prob. 22ECh. 8.3 - Prob. 23ECh. 8.3 - Prob. 24ECh. 8.3 - Prob. 25ECh. 8.3 - Prob. 26ECh. 8.4 - (Answers can be found in the back of the book.)
1....Ch. 8.4 - Prob. 2TFQCh. 8.4 - Prob. 3TFQCh. 8.4 - Prob. 4TFQCh. 8.4 - Prob. 5TFQCh. 8.4 - Prob. 6TFQCh. 8.4 - Prob. 7TFQCh. 8.4 - Prob. 8TFQCh. 8.4 - Prob. 9TFQCh. 8.4 - Prob. 10TFQCh. 8.4 - Prob. 1ECh. 8.4 - Use the procedure outlined in this section to list...Ch. 8.4 - Prob. 3ECh. 8.4 - Prob. 4ECh. 8.4 - Prob. 5ECh. 8.4 - Prob. 6ECh. 8.4 - Prob. 7ECh. 8.4 - 8. (a) List, in the lexicographic order, the...Ch. 8.4 - Prob. 9ECh. 8.4 - Prob. 10ECh. 8.4 - Prob. 11ECh. 8.4 - Prob. 12ECh. 8 - Describe how Horners Algorithm evaluates f(x) when...Ch. 8 - Prob. 2RECh. 8 - 3. Let be an integer, let , and let be a subset of...Ch. 8 - Suppose we want an algorithm that, for an input of...Ch. 8 - Prob. 5RECh. 8 - Prob. 6RECh. 8 - Prob. 7RECh. 8 - Prob. 8RECh. 8 - (Requires a little knowledge of calculus) Show...Ch. 8 - Prob. 10RECh. 8 - Prob. 11RECh. 8 - 12. Sort the list 9,-3,1,0,-4,5,3 into increasing...Ch. 8 - 13. In the lexicographic ordering of all...Ch. 8 - Prob. 14RE
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- there is a factory that makes widgets in different colors. The production time for each color is different. At the end of each day, all the widgets produced that day are placed in boxes. On a certain day, the factory made 1,620 yellow widgets and 5,760 pink widgets. It takes 18 minutes to produce a batch of yellow widgets and 40 minutes to produce a batch of pink widgets. Determine the largest number of widgets that can be placed in each box if it is required that all boxes contain the same number of widgets and each box contains only one color. Explain the steps and problem-solving strategy used to determine the answer E. Determine the largest number of widgets that can be placed in each box if it is required that all boxes contain the same number of widgets and each box contains only one color. Explain the steps and problem-solving strategy used to determine the answer. 1. Explain why the final answer is a greatest common divisor, least common multiple, or neitherarrow_forwardevaulatearrow_forwardThere is a factory that makes widgets in different colors. The production time for each color is different. At the end of each day, all the widgets produced that day are placed in boxes. On a certain day, the factory made 1,680 green widgets and 8,640 purple widgets. It takes 12 minutes to produce a batch of green widgets and 45 minutes to produce a batch of purple widgets. Determine the largest number of widgets that can be placed in each box if it is required that all boxes contain the same number of widgets and each box contains only one color. Explain the steps and problem-solving strategy used to determine the answer. 1. Explain why the final answer is a greatest common divisor, least common multiple, or neither.arrow_forward
- Show detailed computations.arrow_forwardA small high school has 30 seniors, 20 juniors, and 10 sophomores. If 3 students are chosen from each class to be on a school board, how many different board can be selected? Show all work. Show all workarrow_forwardThere is a factory that makes widgets in different colors. The production time for each color is different. At the end of each day, all the widgets produced that day are placed in boxes. On a certain day, the factory made 1,900 gold widgets and 4,680 red widgets. It takes 40 minutes to produce a batch of gold widgets and 26 minutes to produce a batch of red widgets. Determine the largest number of widgets that can be placed in each box if it is required that all boxes contain the same number of widgets and each box contains only one color. Explain the steps and problem-solving strategy used to determine the answer. 1. Explain why the final answer is a greatest common divisor, least common multiple, or neither. F. Determine the answer to the following question: “In a factory, if both colors of widgets start production at the same time and run continuously, after how many minutes will their starting time align again?” Explain the steps and problem-solving strategy used to determine…arrow_forward
- Suppose that an outbreak of cholera follows severe flooding in an isolated town of 3198 people. Initially (Day 0), 62 people are infected. Every day after, 15% of those still healthy fall ill. At the beginning of the first day (Day 1), how many people are still healthy? How many will fall ill during the first day? What is the total number of people infected after the first dayarrow_forwardFind the number of different ways in which 3 flags can be displayed on a flagpole, one above the other, if 11 different flags are available.arrow_forwardCount the number of strings of m 0s and n 1s that have exactly k blocks of consecutive 1s.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
Algebra: Structure And Method, Book 1
Algebra
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:McDougal Littell
12. Searching and Sorting; Author: MIT OpenCourseWare;https://www.youtube.com/watch?v=6LOwPhPDwVc;License: Standard YouTube License, CC-BY
Algorithms and Data Structures - Full Course for Beginners from Treehouse; Author: freeCodeCamp.org;https://www.youtube.com/watch?v=8hly31xKli0;License: Standard Youtube License