Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
32 views

Dynamic Programming

The document discusses the two approaches to dynamic programming - top-down and bottom-up. The top-down approach is memoization, which solves smaller subproblems first and stores their solutions in a table. The bottom-up approach is tabulation, which builds up the solution using previously solved subproblems, starting from the simplest cases and moving to more complex problems. Dynamic programming can be used to optimize solutions to problems exhibiting overlapping subproblems and optimal substructure.

Uploaded by

Sangeeta Yadav
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
32 views

Dynamic Programming

The document discusses the two approaches to dynamic programming - top-down and bottom-up. The top-down approach is memoization, which solves smaller subproblems first and stores their solutions in a table. The bottom-up approach is tabulation, which builds up the solution using previously solved subproblems, starting from the simplest cases and moving to more complex problems. Dynamic programming can be used to optimize solutions to problems exhibiting overlapping subproblems and optimal substructure.

Uploaded by

Sangeeta Yadav
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

@Aakash Kanojiya

Dynamic
programming !
@Aakash Kanojiya

Dynamic Programming ?
@Aakash Kanojiya

How did you calculated so quick ?


@Aakash Kanojiya

Dynamic Programming ?

Definition of dynamic programming says


@Aakash Kanojiya

Approcahes of
Dynamic programming

Two approaches of dynamic programming

Top-down approach (Memoization)


Bottom-up approach (Tabulation)
@Aakash Kanojiya

Top-down approach
@Aakash Kanojiya

Bottom-up approach
Thanks for reading !
Follow my profile for more

coding related contents

Like Comment Share

@Aakash Kanojiya

You might also like