0 votes 0 votes Is there any better approach to solve 0/1 knapsack problem other than tabular method ? as it consumes a lot of time when greater number of objects are given. Algorithms algorithms knapsack-problem + – Shivam Kasat asked Jan 8, 2019 Shivam Kasat 426 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Navneet Kalra commented Jan 8, 2019 reply Follow Share if you are using c++ then you can use stl and also can use ios_base::sync_with_stdio(false) statement...these will really help in reducing your time but not much...you can use the while writing code for knapsack using dynamic programming but algo wise dp with tabular is the best for solving 0/1 fractional knapsack 0 votes 0 votes Shivam Kasat commented Jan 9, 2019 reply Follow Share @Navneet Kalra brother I am talking about solving GATE problems related to knapsack 0 votes 0 votes Navneet Kalra commented Jan 9, 2019 reply Follow Share Ya i don't know better approach than this 0 votes 0 votes Please log in or register to add a comment.
