Change all the snake_cases to camelCases

Author: 64json

Backtracking/Knight's tour problem/code.js

@@ -5,11 +5,11 @@ caused by large number of recursive calls
 */
 const N = 3;
 const board = new Array(N);
-for (var i = board.length - 1; i >= 0; i--) {
+for (let i = board.length - 1; i >= 0; i--) {
   board[i] = new Array(N);
 }
 
-for (var i = board.length - 1; i >= 0; i--) {
+for (let i = board.length - 1; i >= 0; i--) {
   for (let j = board[i].length - 1; j >= 0; j--) {
     board[i][j] = -1;
   }

Cryptography/Affine Cipher/code.js

@@ -9,7 +9,7 @@ function randString(length) {
   return text;
 }
 
-// var plainText = randString (5);
+// let plainText = randString (5);
 const plainText = 'secret';
 const ptTracer = new Array1DTracer('Encryption');
 const ctTracer = new Array1DTracer('Decryption');
@@ -42,7 +42,7 @@ function encrypt(plainText) {
   }
 
   logger.print('Beginning Affine Encryption');
-  logger.print('Encryption formula: <b>((keys.a * index_of_alphabet) + keys.b) % N</b>');
+  logger.print('Encryption formula: <b>((keys.a * indexOfAlphabet) + keys.b) % N</b>');
   logger.print(`keys.a=${keys.a}, keys.b=${keys.b}, N=${N}`);
 
   for (const i in plainText) {

Dynamic Programming/Catalan Number/code.js

@@ -1,6 +1,6 @@
 const N = 10;
 const A = new Array(N + 1);
-for (var i = N; i >= 0; i--) {
+for (let i = N; i >= 0; i--) {
   A[i] = 0;
 }
 
@@ -14,7 +14,7 @@ A[1] = 1;
 tracer.notify(1, A[1]).wait();
 tracer.denotify(1);
 
-for (var i = 2; i <= N; i++) {
+for (let i = 2; i <= N; i++) {
   for (let j = 0; j < i; j++) {
     A[i] += A[j] * A[i - j - 1];
     tracer.select(j).wait();

Dynamic Programming/Fibonacci Sequence/code.js

@@ -1,13 +1,13 @@
 const tracer = new Array1DTracer('Sequence');
 const index = 15;
 const D = [1, 1];
-for (var i = 2; i < index; i++) {
+for (let i = 2; i < index; i++) {
   D.push(0);
 }
 tracer.set(D);
 
 
-for (var i = 2; i < index; i++) {
+for (let i = 2; i < index; i++) {
   D[i] = D[i - 2] + D[i - 1];
   tracer.select(i - 2, i - 1).wait();
   tracer.notify(i, D[i]).wait();

Dynamic Programming/Knapsack Problem/code.js

@@ -4,9 +4,9 @@ const W = 7; // The maximum weight we can carry in our collection
 const N = val.length;
 const DP = new Array(N + 1);
 
-for (var i = 0; i < N + 1; i++) {
+for (let i = 0; i < N + 1; i++) {
   DP[i] = new Array(W + 1);
-  for (var j = 0; j < W + 1; j++) {
+  for (let j = 0; j < W + 1; j++) {
     DP[i][j] = 0;
   }
 }
@@ -17,8 +17,8 @@ const dataViewer2 = new Array1DTracer('Weights').set(wt);
 const logger = new LogTracer();
 
 
-for (var i = 0; i <= N; i++) {
-  for (var j = 0; j <= W; j++) {
+for (let i = 0; i <= N; i++) {
+  for (let j = 0; j <= W; j++) {
     if (i === 0 || j === 0) {
       /*
 			If we have no items or maximum weight we can take in collection is 0

Dynamic Programming/Longest Common Subsequence/code.js

@@ -3,7 +3,7 @@ const string2 = 'GXTXAYB';
 const m = string1.length;
 const n = string2.length;
 const A = new Array(m + 1);
-for (var i = 0; i < m + 1; i++) {
+for (let i = 0; i < m + 1; i++) {
   A[i] = new Array(n + 1);
 }
 
@@ -12,7 +12,7 @@ const tracer2 = new Array1DTracer('String 2').set(string2);
 const tracer3 = new Array2DTracer('Memo Table').set(A);
 const logger = new LogTracer();
 
-var i,
+let i,
   j;
 
 // Build the memo table in bottom up fashion

Dynamic Programming/Longest Increasing Subsequence/code.js

@@ -5,13 +5,13 @@ const LIS = new Array(A.length);
 tracer.set(A);
 
 // Initialize LIS values for all indexes
-for (var i = 0; i < A.length; i++) {
+for (let i = 0; i < A.length; i++) {
   LIS[i] = 1;
 }
 
 logger.print('Calculating Longest Increasing Subsequence values in bottom up manner ');
 // Compute optimized LIS values in bottom up manner
-for (var i = 1; i < A.length; i++) {
+for (let i = 1; i < A.length; i++) {
   tracer.select(i);
   logger.print(` LIS[${i}] = ${LIS[i]}`);
   for (let j = 0; j < i; j++) {
@@ -28,7 +28,7 @@ for (var i = 1; i < A.length; i++) {
 // Pick maximum of all LIS values
 logger.print('Now calculate maximum of all LIS values ');
 let max = LIS[0];
-for (var i = 1; i < A.length; i++) {
+for (let i = 1; i < A.length; i++) {
   if (max < LIS[i]) {
     max = LIS[i];
   }

Dynamic Programming/Maximum Sum Path/code.js

@@ -3,9 +3,9 @@ const dataViewer = new Array2DTracer().set(D);
 const tracer = new Array2DTracer('Results Table');
 const logger = new LogTracer();
 const DP = [];
-for (var i = 0; i < D.length; i++) {
+for (let i = 0; i < D.length; i++) {
   DP.push([]);
-  for (var j = 0; j < D[i].length; j++) {
+  for (let j = 0; j < D[i].length; j++) {
     DP[i].push(Infinity);
   }
 }
@@ -21,8 +21,8 @@ function update(i, j, value) {
   tracer.denotify(i, j);
   dataViewer.deselect(i, j);
 }
-for (var i = 0; i < N; i++) {
-  for (var j = 0; j < M; j++) {
+for (let i = 0; i < N; i++) {
+  for (let j = 0; j < M; j++) {
     if (i === 0 && j === 0) {
       update(i, j, D[i][j]);
     } else if (i === 0) {

Dynamic Programming/Pascal's Triangle/code.js

@@ -1,13 +1,13 @@
 const N = 9;
 const A = new Array(N);
-for (var i = N - 1; i >= 0; i--) {
+for (let i = N - 1; i >= 0; i--) {
   A[i] = new Array(N);
 }
 
 const tracer = new Array2DTracer('Pascal\'s Triangle').set(A);
 
 
-for (var i = 0; i < N; i++) {
+for (let i = 0; i < N; i++) {
   for (let j = 0; j <= i; j++) {
     if (j === i || j === 0) { // First and last values in every row are 1
       A[i][j] = 1;

Dynamic Programming/Shortest Common Supersequence/code.js

@@ -3,7 +3,7 @@ const string2 = 'GXTXAYB';
 const m = string1.length;
 const n = string2.length;
 const A = new Array(m + 1);
-for (var i = 0; i < m + 1; i++) {
+for (let i = 0; i < m + 1; i++) {
   A[i] = new Array(n + 1);
 }
 
@@ -12,7 +12,7 @@ const tracer2 = new Array1DTracer('String 2').set(string2);
 const tracer3 = new Array2DTracer('Memo Table').set(A);
 const logger = new LogTracer();
 
-var i,
+let i,
   j;
 
 // Fill memo table in bottom up manner