Skip to content

Create RodCutting.js #776

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged

raklaptudirm merged 3 commits into TheAlgorithms:master from raghhavtaneja:raghhavtaneja-patch-1

Oct 20, 2021

Merged

Create RodCutting.js #776

Changes from 1 commit

Commits

Show all changes

Select commit Hold shift + click to select a range

Create RodCutting.js

raghhavtaneja Oct 11, 2021

added tests for rodCutting and made some changes

raghhavtaneja Oct 12, 2021

resolved style issues in the code

raghhavtaneja Oct 12, 2021

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

27 changes: 27 additions & 0 deletions Dynamic-Programming/RodCutting.js

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,27 @@
	/*
	* You are given a rod of 'n' length and an array of prices associated with all the lengths less than 'n'.
	* Find the maximum profit possible by cutting the rod and selling the pieces.
	*/

	function rodCut(prices, n){
	let memo = new Array(n + 1);
	memo[0] = 0;

	for (let i = 1; i<=n; i++)
	{
	let max_val = Number.MIN_VALUE;
	for (let j = 0; j < i; j++)
	max_val = Math.max(max_val, prices[j] + memo[i - j - 1]);
	memo[i] = max_val;
	}

	return memo[n];
	}

	function main(){
raklaptudirm marked this conversation as resolved. Show resolved Hide resolved
	let arr = [1, 5, 4, 2, 1, 11, 19, 12];
	let n = arr.length;
	console.log('Maximum Possible Profit is : '+ rodCut(arr,n));
	}

	main();