Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
Look up keyword
Like this
0 of .
Results for:
No results containing your search query
P. 1
L-13 Dynamic Programming

L-13 Dynamic Programming

Ratings: (0)|Views: 108|Likes:
Published by api-19981384

More info:

Published by: api-19981384 on Dec 03, 2009
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





Dynamic Programming
Lecture 12
Umar Manzoor
Dynamic Programming
\ue000Dynamic programming like the divide and conquer
method, solves problem by combining the solutions of
sub problems
\ue000Divide and conquer method partition the problem into

independent sub problems, solves the sub problems recursively and then combine their solutions to solve the original problem.

\ue000Dynamic programming is applicable, when the sub-
problems areNOT
NOTindependent, that is when sub-
problems share sub sub-problems.
\ue000It is making a set of choices to arrive at optimal
\ue000If sub-problems are not independent, we have to
further divide the problem.
\ue000In worst case, we may end-up with an exponential
time algorithm.
Dynamic Programming

Activity (4)

You've already reviewed this. Edit your review.
1 hundred reads
Vesna liked this
mann2323 liked this
BoaHancock92 liked this

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->