Merge data and code parts into one

Author: 64json

Backtracking/Knight's tour problem/Knight's tour problem/data.js

@@ -1,3 +1,33 @@
+/*
+For N>3 the time taken by this algorithm is sufficiently high
+Also it is not possible to visualise for N>6 due to stack overflow 
+caused by large number of recursive calls
+*/
+var N = 3;
+var board = new Array (N);
+for (var i = board.length - 1; i >= 0; i--) {
+	board[i] = new Array (N);
+}
+
+for (var i = board.length - 1; i >= 0; i--) {
+	for (var j = board[i].length - 1; j >= 0; j--) {
+		board[i][j] = -1;
+	}
+}
+
+/*
+Define the next move of the knight
+*/
+var X = [ 2, 1, -1, -2, -2, -1,  1,  2 ];
+var Y = [ 1, 2,  2,  1, -1, -2, -2, -1 ];
+
+var pos = new Array (2);
+pos[0] = pos[1] = -1;
+
+var boardTracer = new Array2DTracer ('Board').set (board);
+var posTracer = new Array1DTracer ('Knight Position').set (pos);
+var logTracer = new LogTracer ('Console');
+
 function knightTour(x, y, moveNum) {
 	if (moveNum === N*N) {
 		return true;

…ur problem/Knight's tour problem/code.js …cktracking/Knight's tour problem/code.jsBacktracking/Knight's tour problem/Knight's tour problem/code.js renamed to Backtracking/Knight's tour problem/code.js Backtracking/Knight's tour problem/Knight's tour problem/code.js renamed to Backtracking/Knight's tour problem/code.js

@@ -1,3 +1,27 @@
+var N = 4;	//just change the value of N and the visuals will reflect the configuration!
+var board = (function createArray (N) {
+	var result = [];
+	for (var i = 0; i < N; i++) {
+		result [i] = Array.apply(null, Array(N)).map(Number.prototype.valueOf,0);
+	}
+	return result;
+}) (N);
+var queens = (function qSetup (N) {
+	var result = [];
+	for (var i = 0; i < N; i++) {
+		result [i] = [-1,-1];
+	}
+	return result;
+}) (N);
+
+var boardTracer = new Array2DTracer ('Board'),
+	queenTracer = new Array2DTracer ('Queen Positions'),
+	logger = new LogTracer ('Progress');
+
+boardTracer.set (board);
+queenTracer.set (queens);
+logger.print ('N Queens: ' + N + 'X' + N + 'matrix, ' + N + ' queens');
+
 function validState (row, col, currentQueen) {
 	for (var q = 0; q < currentQueen; q++) {
 		var currentQ = queens [q];

Backtracking/N Queens Problem/N Queens/data.js

@@ -1,3 +1,22 @@
+function randString(length) {
+  var choices = 'abcdefghijklmnopqrstuvwxyz';
+  var text = '';
+
+  for (var i = 0; i < length; i++) {
+    text += choices[Integer.random(0, choices.length - 1)];
+  }
+
+  return text;
+}
+
+//var plainText = randString (5);
+var plainText = 'secret';
+var ptTracer = new Array1DTracer('Encryption');
+var ctTracer = new Array1DTracer('Decryption');
+var logger = new LogTracer();
+
+ptTracer.set(plainText);
+
 /*
  code assumes that plainText contains ONLY LOWER CASE ALPHABETS
  */

…acking/N Queens Problem/N Queens/code.js Backtracking/N Queens Problem/code.jsBacktracking/N Queens Problem/N Queens/code.js renamed to Backtracking/N Queens Problem/code.js Backtracking/N Queens Problem/N Queens/code.js renamed to Backtracking/N Queens Problem/code.js

@@ -1,3 +1,20 @@
+var string = 'hello! how are you doing?';
+var rotation = 5;
+var alphabet = 'abcdefghijklmnopqrstuvwxyz';
+// create a map of char -> position to improve run time
+// otherwise we would have to search the alphabet each 
+// time to find the character position
+var alphabetMap = alphabet.split('').reduce(function(map, curr, idx) {
+  map[curr] = idx;
+  return map;
+}, {});
+
+var encryptTracer = new Array1DTracer('Encryption');
+var decryptTracer = new Array1DTracer('Decryption');
+var logger = new LogTracer();
+
+encryptTracer.set(string);
+
 function getPosUp(pos) {
   return (pos === alphabet.length - 1) ? 0 : pos + 1;
 }

Cryptography/Affine Cipher/Affine Cipher/data.js

@@ -1,3 +1,12 @@
+var N = 10;
+var A = new Array ( N+1 );
+for (var i = N; i >= 0; i--) {
+	A[i] = 0;
+}
+
+var tracer = new Array1DTracer( ' Catalan Numbers ').set( A );
+var logger = new LogTracer();
+
 A[0] = 1;
 tracer.notify ( 0, A[0] ).wait();
 tracer.denotify ( 0 );