- ๐ฑ Iโm currently learning various new technologies and frameworks
- ๐ซ How to reach me: Linked In - @sanket-badjate , Youtube - @sanketbadjate
- ๐จโ๐ป Check out my blogs on technical stuff Medium- @sanketbadjate
- ๐ Pronouns: He/His
sanbad36 / 0-1-knapsack-problem-bottom-up-dynamic-promamming-approch Goto Github PK
View Code? Open in Web Editor NEWBy using this method we drastically reduce the time taken by the algorithm to O(number_of_objects * total_capacity_of_knapsack) ,otherwise it takes O(2^n) time.