×
×

# a) Use pseudocode to describe the algorithm that puts the

ISBN: 9780073383095 37

## Solution for problem 6E Chapter 3.3

Discrete Mathematics and Its Applications | 7th Edition

• Textbook Solutions
• 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 1 284 Reviews
16
5
Problem 6E

a) Use pseudocode to describe the algorithm that puts the first four terms of a list of real numbers of arbitrary length in increasing order using the insertion sort.________________b) Show that this algorithm has time complexity O(1) in terms of the number of comparisons used.

Step-by-Step Solution:

SolutionStep 1a)In this problem, we have to write the pseudocode to describe the algorithm for sorting the first four-term by using the insertion sort.Step 2Pseudo Code for sort the first four item in a list Using Insertion Sort.Insertion_sort (num1 , num2, num3, ………… set of integers) Now, start the loop For (index_1 = 1 ; index < 4 ; index++) Assume the temporary variable we can interchange the position of the elementTemp = element at ith position Now, initialize the another index index_2 for comparing the value index_2 = index_1 - 1Now, start the another loop While (temp < element at index_2 position && index_2 > = 0(This condition is required because the index_2 goes to...

Step 2 of 3

Step 3 of 3

##### ISBN: 9780073383095

Since the solution to 6E from 3.3 chapter was answered, more than 966 students have viewed the full step-by-step answer. The full step-by-step solution to problem: 6E from chapter: 3.3 was answered by , our top Math solution expert on 06/21/17, 07:45AM. The answer to “a) Use pseudocode to describe the algorithm that puts the first four terms of a list of real numbers of arbitrary length in increasing order using the insertion sort.________________b) Show that this algorithm has time complexity O(1) in terms of the number of comparisons used.” is broken down into a number of easy to follow steps, and 45 words. This full solution covers the following key subjects: Algorithm, terms, order, complexity, describe. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7.

#### Related chapters

Unlock Textbook Solution