L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA)
268985 People Read – 5727 People Liked – You Can Also Like
Dynamic Programming: It divides the problem into series of overlapping sub-problems.
Two features
1) Optimal Substructure
2) Overlapping Subproblems
►Full Course of Design and Analysis of algorithms (DAA):
►Subscribe to our new channel:
https://www.youtube.com/c/GateSmashersPlus
Other subject playlist Link:
————————————————————————————————————————————–
►Computer Architecture:
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
► Computer Networks:
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:
—————————————————————————————————————————————
Our social media Links:
► Subscribe us on YouTube: https://www.youtube.com/gatesmashers
► Like our page on Facebook: https://www.facebook.com/gatesmashers
► Follow us on Instagram: https://www.instagram.com/gate.smashers
► Follow us on Telegram: https://t.me/gatesmashersofficial
————————————————————————————————————————————–
►For Any Query, Email us at: [email protected]
►Be a Member & Give your Support on the below link: https://www.youtube.com/channel/UCJihyK0A38SZ6SdJirEdIOw/join