Modify code to accept any array length

archie94 · archie94 · commit ea8db17e4d94 · 2016-05-24T21:13:05.000+05:30
diff --git a/algorithm/etc/dp/longest_increasing_subsequence/code.js b/algorithm/etc/dp/longest_increasing_subsequence/code.js
@@ -7,7 +7,7 @@ for( var i = 0; i < 20; i++) {
 
 tracer._print( 'Calculating Longest Increasing Subsequence values in bottom up manner ');
 // Compute optimized LIS values in bottom up manner
-for( var i = 1; i < 10; i++) {
+for( var i = 1; i < A.length; i++) {
 	tracer._select(i) ;
 	tracer._print( ' LIS['+i+'] = ' + LIS[i]);
 	for( var j =0; j < i; j++) {
@@ -23,7 +23,7 @@ for( var i = 1; i < 10; i++) {
 // Pick maximum of all LIS values
 tracer._print( 'Now calculate maximum of all LIS values ');
 var max = LIS[0];
-for( var i = 1; i < 10; i++) {
+for( var i = 1; i < A.length; i++) {
 	if(max < LIS[i]) {
 		max = LIS[i];
 	}
diff --git a/algorithm/etc/dp/longest_increasing_subsequence/data.js b/algorithm/etc/dp/longest_increasing_subsequence/data.js
@@ -1,4 +1,4 @@
 var tracer = new Array1DTracer();
 var A = Array1D.random(10, 0, 10);
-var LIS = new Array(10);
+var LIS = new Array(A.length);
 tracer._setData(A);
