0 Up votes0 Down votes

8 views7 pagesDivide and conquer techniques of algorithms

Mar 23, 2016

© © All Rights Reserved

PDF, TXT or read online from Scribd

Divide and conquer techniques of algorithms

© All Rights Reserved

8 views

Divide and conquer techniques of algorithms

© All Rights Reserved

- Algorithms Math Intro
- Network Time protocol
- TCP/IP Protocol
- NTP
- Steam Power Plants
- Design of Basic Electric Vehicle Drive for Energy Flow Estimation by Jay
- Installing R and Basic Commands
- Electric Charges and Fields
- Presentation
- Ic1251 Control Systems
- The Subtle Art of Not Giving a F*ck: A Counterintuitive Approach to Living a Good Life
- Sapiens: A Brief History of Humankind
- Hidden Figures: The American Dream and the Untold Story of the Black Women Mathematicians Who Helped Win the Space Race
- Shoe Dog: A Memoir by the Creator of Nike
- The Unwinding: An Inner History of the New America
- The Little Book of Hygge: Danish Secrets to Happy Living
- Never Split the Difference: Negotiating As If Your Life Depended On It
- Elon Musk: Tesla, SpaceX, and the Quest for a Fantastic Future
- Yes Please
- A Heartbreaking Work Of Staggering Genius: A Memoir Based on a True Story

You are on page 1of 7

b is number of subproblems

Equation 3.8

merge subproblem solutions

combination of the two

cost of leaves

Critical Exponent

lg (n)

base case (leaves) at depth D=

lg (c)

D

L=b

nodes (leaves) at depth D are

lg(b)

lg n

lg(c)

lg(b)

E=

lg(c)

Lemma 3.14

Equation 3.8 is approximately L=n E where E is

the critical exponent definition is the previous

slide

Cost of recursion tree is at least L=n E

Lemma 3.15

1)The recursion tree has depth

about that many row-sums

, so there are

D=lg (n)/lg(c)

the root

3)The Dth row-sum is n E, assuming the base cases cost

1 or (n E )

4)The value of T(n), the solution of Equation 3.8, is the

sum of the nonrecursive costs of all the nodes in the

tree, which is the sum of the row-sums

Theorem

defined in Equation 3.8

series, then T (n)(n E )

2)If the row-sums remain about constant,

T (n)(f (n)log (n))

series, then T (n)(f (n)) (proportional to the nonrecursive costs.

n

T (n)=bT ( )+ f (n)

c

T (n)(n E ) which is proporational to the number of leaves in the

recursion tree

E

, then

3) If f (n)(n

E +

T (n)(f (n)) which is proportional to the nonrecursive cost at the

Since subproblem size decrease by a constant the tree depth is about D = n/c

Even if f(n) = 1

n/c

d

d=0

n/ c

n/ c

f (ch)

bh

h=0

which is exponential in b

If b = 1 better case

n/c

n/c

d=0

If f(n) is polynomial

h=0

1

f ( x) dx

c 0

- Algorithms Math IntroUploaded byjayanth_bablu
- Network Time protocolUploaded byjayanth_bablu
- TCP/IP ProtocolUploaded byjayanth_bablu
- NTPUploaded byjayanth_bablu
- Steam Power PlantsUploaded byjaidi
- Design of Basic Electric Vehicle Drive for Energy Flow Estimation by JayUploaded byjayanth_bablu
- Installing R and Basic CommandsUploaded byjayanth_bablu
- Electric Charges and FieldsUploaded bykapil
- PresentationUploaded byAmarpreet Singh
- Ic1251 Control SystemsUploaded byscribdcurrenttext

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.