×
×

# Show that Algorithm 4 uses O(q log a) bit operations, ISBN: 9780073383095 37

## Solution for problem 59E Chapter 4.2

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 271 Reviews
15
5
Problem 59E

Show that Algorithm 4 uses O(q log a) bit operations, assuming that a > d.

Step-by-Step Solution:

Solution:Step 1:The answer to this question we have to show that the number of bit operations used by algorithm is O(q loga).Step 2:In Given algorithm:The most time consuming part of the algorithm is below while loop.Procedure division algorithm (a: integer, d: positive integer)q :=0r := While r r := r-dq := q+1If a < 0 and r >0 thenr := d-rq := -(q+1)Return (q,r) {q =a div d is the quotient , r = a mod d is the remainder}Step 3:In this algorithm, only time-consuming part is:While r r := r-dq := q+1End while

Step 3 of 3

##### ISBN: 9780073383095

The answer to “Show that Algorithm 4 uses O(q log a) bit operations, assuming that a > d.” is broken down into a number of easy to follow steps, and 15 words. Since the solution to 59E from 4.2 chapter was answered, more than 259 students have viewed the full step-by-step answer. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. This full solution covers the following key subjects: Algorithm, assuming, bit, log, operations. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. The full step-by-step solution to problem: 59E from chapter: 4.2 was answered by , our top Math solution expert on 06/21/17, 07:45AM.

Unlock Textbook Solution