Python Programming – Cutting a Rod – Dynamic Programming A rod of length n inches and an array of prices that contains prices of all pieces of size small
rod cutting problem
5 Articles
5
Java Programming – Cutting a Rod – Dynamic Programming A rod of length n inches and an array of prices that contains prices of all pieces of size small
C++ Programming – Cutting a Rod – Dynamic Programming Given a rod of length n inches and an array of prices that contains prices of all pieces of size small
Backtracking Set 4 (Subset Sum) – Backtracking – Subset sum problem is to find subset of elements that are selected from a given set whose sum adds up.
Activity Selection Problem – Greedy Algorithm – Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit.