×
Log in to StudySoup
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 4.2 - Problem 57e
Join StudySoup for FREE
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 4.2 - Problem 57e

Already have an account? Login here
×
Reset your password

Estimate the complexity of Algorithm 1 for finding the

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

Solution for problem 57E 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 | ISBN: 9780073383095 | Authors: Kenneth Rosen

Discrete Mathematics and Its Applications | 7th Edition

4 5 1 386 Reviews
29
3
Problem 57E

Estimate the complexity of Algorithm 1 for finding the base b expansion of an integer n in terms of the number of divisions used.

Step-by-Step Solution:

Solution In this question we have to estimate the complexity of Algorithm 1 for finding the base b expansion of an integer n in terms of the number of divisions used.Step 1 Complexity of algorithm : Amount of time/space required by an algorithm for an input of a given size.We know that , Algorithm 1 (Constructing Base b Expansions)procedure base b expansion(n,b:positive integers with b>1)k:=nj:=0while kj:= j+1returnThus the number of divisions equals the number of digits in the base b expansion of n, this is just like the example divisions are required.Therefore the complexity of this is

Step 2 of 1

Chapter 4.2, Problem 57E is Solved
Textbook: Discrete Mathematics and Its Applications
Edition: 7
Author: Kenneth Rosen
ISBN: 9780073383095

Other solutions

People also purchased

Related chapters

Unlock Textbook Solution

Enter your email below to unlock your verified solution to:

Estimate the complexity of Algorithm 1 for finding the