Add randomize module

64json · 64json · commit 3e6a590fd77e · 2018-05-02T11:02:41.000-05:00
diff --git a/Cryptography/Affine Cipher/code.js b/Cryptography/Affine Cipher/code.js
@@ -3,7 +3,7 @@ function randString(length) {
   var text = '';
 
   for (var i = 0; i < length; i++) {
-    text += choices[Integer.random(0, choices.length - 1)];
+    text += choices[Randomize.integer(0, choices.length - 1)];
   }
 
   return text;
diff --git a/Dynamic Programming/Integer Partition/code.js b/Dynamic Programming/Integer Partition/code.js
@@ -1,5 +1,6 @@
-var tracer = new Array2DTracer().log(new LogTracer());
-var integer = Integer.random(5, 14);
+var tracer = new Array2DTracer();
+var logger = new LogTracer();
+var integer = Randomize.integer(5, 14);
 var D = [], A = [];
 for (var i = 0; i <= integer; i++) {
   D.push([]);
@@ -10,7 +11,7 @@ for (var i = 0; i <= integer; i++) {
 tracer.set(D);
 
 function partition(A, n, p){
-  if (n === 0) tracer.logTracer.print('[' + A.join(', ') + ']');
+  if (n === 0) logger.print('[' + A.join(', ') + ']');
   else {
     var end = n;
     if (p !== 0 && A[p-1] < n) end = A[p-1];
@@ -37,7 +38,7 @@ function integerPartition(n){
   return D[n][n];
 }
 
-tracer.logTracer.print('Partitioning: ' + integer);
+logger.print('Partitioning: ' + integer);
 partition(A, integer, 0);
 var part = integerPartition(integer);
-tracer.logTracer.print(part);
+logger.print(part);
diff --git a/Dynamic Programming/Longest Increasing Subsequence/code.js b/Dynamic Programming/Longest Increasing Subsequence/code.js
@@ -1,6 +1,6 @@
 var tracer = new Array1DTracer();
 var logger = new LogTracer();
-var A = Array1D.random(10, 0, 10);
+var A = Randomize.array1D(10, { min: 0, max: 10 });
 var LIS = new Array(A.length);
 tracer.set(A);
 
diff --git a/Dynamic Programming/Maximum Sum Path/code.js b/Dynamic Programming/Maximum Sum Path/code.js
@@ -1,4 +1,4 @@
-var D = Array2D.random(5, 5, 1, 5);
+var D = Randomize.array2D(5, 5, { min: 1, max: 5 });
 var dataViewer = new Array2DTracer().set(D);
 var tracer = new Array2DTracer('Results Table');
 var logger = new LogTracer();
diff --git a/Dynamic Programming/Sliding Window/code.js b/Dynamic Programming/Sliding Window/code.js
@@ -1,7 +1,6 @@
 var tracer = new Array1DTracer();
 var logger = new LogTracer();
-tracer.log(logger);
-var D = Array1D.random(20, -5, 5);
+var D = Randomize.array1D(20, { min: -5, max: 5 });
 tracer.set(D);
 
 var sum = D[0] + D[1] + D[2];
diff --git a/Graph Search/All Paths (DFS)/code.js b/Graph Search/All Paths (DFS)/code.js
@@ -1,7 +1,7 @@
-var tracer = new UndirectedGraphTracer();
+var tracer = new GraphTracer({ directed: false });
 var logger = new LogTracer();
 tracer.log(logger);
-var G = UndirectedGraph.random(5, 1);
+var G = Randomize.graph(5, { directed: false, ratio: 1 });
 tracer.set(G);
 
 function DFS(node, parent) { // node = current node, parent = previous node
diff --git a/Graph Search/Bellman-Ford/code.js b/Graph Search/Bellman-Ford/code.js
@@ -1,7 +1,7 @@
-var tracer = new WeightedDirectedGraphTracer();
+var tracer = new GraphTracer({ directed: true, weighted: true });
 var logger = new LogTracer();
 tracer.log(logger);
-var G = WeightedDirectedGraph.random(5, .5, -2, 5);
+var G = Randomize.graph(5, { directed: true, weighted: true, ratio: .5, min: -2, max: 5 });
 tracer.set(G);
 
 
@@ -59,7 +59,7 @@ function BELLMAN_FORD(src, dest) {
   return weights[dest];
 }
 
-var src = Integer.random(0, G.length - 1), dest;
+var src = Randomize.integer(0, G.length - 1), dest;
 var MAX_VALUE = Infinity;
 var minWeight;
 
@@ -69,7 +69,7 @@ var minWeight;
  */
 
 do {
-  dest = Integer.random(0, G.length - 1);
+  dest = Randomize.integer(0, G.length - 1);
 }
 while (src === dest);
 
diff --git a/Graph Search/DFS Exploration/code.js b/Graph Search/DFS Exploration/code.js
@@ -1,8 +1,8 @@
-var graphTracer = new UndirectedGraphTracer();
+var graphTracer = new GraphTracer({ directed: false });
 var visitedTracer = new Array1DTracer('visited');
 var logger = new LogTracer();
 graphTracer.log(logger);
-var G = UndirectedGraph.random(8, .3);
+var G = Randomize.graph(8, { directed: false, ratio: .3 });
 graphTracer.set(G);
 
 function DFSExplore(graph, source) {
diff --git a/Graph Search/DFS Weighted Graph/code.js b/Graph Search/DFS Weighted Graph/code.js
@@ -1,7 +1,7 @@
-var tracer = new WeightedUndirectedGraphTracer();
+var tracer = new GraphTracer({ directed: false, weighted: true });
 var logger = new LogTracer();
 tracer.log(logger);
-var G = WeightedUndirectedGraph.random(5, 1);
+var G = Randomize.graph(5, { directed: false, weighted: true, ratio: 1 });
 tracer.set(G);
 
 function DFS(node, parent, weight) { // node = current node, parent = previous node
diff --git a/Graph Search/Dijkstra/code.js b/Graph Search/Dijkstra/code.js
@@ -1,8 +1,8 @@
-var tracer = new WeightedUndirectedGraphTracer();
+var tracer = new GraphTracer({ directed: false, weighted: true });
 var tracerS = new Array1DTracer();
 var logger = new LogTracer();
 tracer.log(logger);
-var G = WeightedUndirectedGraph.random(5, 1, 1, 9);
+var G = Randomize.graph(5, { directed: false, weighted: true, ratio: 1, min: 1, max: 9 });
 tracer.set(G);
 var MAX_VALUE = Infinity;
 var S = []; // S[end] returns the distance from start node to end node
@@ -50,10 +50,10 @@ function Dijkstra(start, end) {
     }
 }
 
-var s = Integer.random(0, G.length - 1); // s = start node
+var s = Randomize.integer(0, G.length - 1); // s = start node
 var e; // e = end node
 do {
-    e = Integer.random(0, G.length - 1);
+    e = Randomize.integer(0, G.length - 1);
 } while (s === e);
 logger.print('finding the shortest path from ' + s + ' to ' + e).wait();
 Dijkstra(s, e);
diff --git a/Graph Search/Floyd-Warshall/code.js b/Graph Search/Floyd-Warshall/code.js
@@ -1,7 +1,7 @@
-var tracer = new WeightedDirectedGraphTracer();
+var tracer = new GraphTracer({ directed: true, weighted: true });
 var logger = new LogTracer();
 tracer.log(logger);
-var G = WeightedDirectedGraph.random(5, 1, 1, 9);
+var G = Randomize.graph(5, { directed: true, weighted: true, ratio: 1, min: 1, max: 9 });
 tracer.set(G);
 
 function FloydWarshall() {
diff --git a/Graph Search/PageRank Algorithm (V2)/code.js b/Graph Search/PageRank Algorithm (V2)/code.js
@@ -2,7 +2,7 @@ function filledArray (length, value) {
 	return Array.apply (null, Array (length)).map (Number.prototype.valueOf, value);
 }
 
-var G = new DirectedGraph.random (5, 0.4),
+var G = Randomize.graph(5, { ratio: .4 }),
 	ranks,
 	outgoingEdgeCounts = filledArray (G.length, 0),
 	incomingNodes;
diff --git a/Graph Search/PageRank Algorithm/code.js b/Graph Search/PageRank Algorithm/code.js
@@ -2,7 +2,7 @@ function filledArray (length, value) {
 	return Array.apply (null, Array (length)).map (Number.prototype.valueOf, value);
 }
 
-var G = new DirectedGraph.random (5, 0.4),
+var G = Randomize.graph(5, { ratio: .4 }),
 	ranks,
 	outgoingEdgeCounts = filledArray (G.length, 0),
 	incomingNodes;
diff --git a/Graph Search/Shortest Path (BFS)/code.js b/Graph Search/Shortest Path (BFS)/code.js
@@ -1,7 +1,7 @@
-var tracer = new WeightedUndirectedGraphTracer();
+var tracer = new GraphTracer({ directed: false, weighted: true });
 var logger = new LogTracer();
 tracer.log(logger);
-var G = WeightedUndirectedGraph.random(5, 1, 1, 9);
+var G = Randomize.graph(5, { directed: false, weighted: true, ratio: 1, min: 1, max: 9 });
 tracer.set(G);
 
 function BFS() {
@@ -29,10 +29,10 @@ function BFS() {
     }
     return W[e];
 }
-var s = Integer.random(0, G.length - 1); // s = start node
+var s = Randomize.integer(0, G.length - 1); // s = start node
 var e; // e = start node
 do {
-    e = Integer.random(0, G.length - 1);
+    e = Randomize.integer(0, G.length - 1);
 } while (s === e);
 var MAX_VALUE = Infinity;
 logger.print('finding the shortest path from ' + s + ' to ' + e);
diff --git a/Graph Search/Shortest Path (DFS)/code.js b/Graph Search/Shortest Path (DFS)/code.js
@@ -1,7 +1,7 @@
-var tracer = new WeightedUndirectedGraphTracer();
+var tracer = new GraphTracer({ directed: false, weighted: true });
 var logger = new LogTracer();
 tracer.log(logger);
-var G = WeightedUndirectedGraph.random(5, 1, 1, 9);
+var G = Randomize.graph(5, { directed: false, weighted: true, ratio: 1, min: 1, max: 9 });
 tracer.set(G);
 
 function DFS(node, parent, weight) { // node = current node, parent = previous node
@@ -26,10 +26,10 @@ function DFS(node, parent, weight) { // node = current node, parent = previous n
     D[node] = false; // label current node as undiscovered
     tracer.leave(node, parent, 0).wait();
 }
-var s = Integer.random(0, G.length - 1); // s = start node
+var s = Randomize.integer(0, G.length - 1); // s = start node
 var e; // e = end node
 do {
-    e = Integer.random(0, G.length - 1);
+    e = Randomize.integer(0, G.length - 1);
 } while (s === e);
 var MAX_VALUE = Infinity;
 var minWeight = MAX_VALUE;
diff --git a/Graph Search/Test Bipartiteness/code.js b/Graph Search/Test Bipartiteness/code.js
@@ -1,4 +1,4 @@
-var tracer = new UndirectedGraphTracer();
+var tracer = new GraphTracer({ directed: false });
 var logger = new LogTracer();
 tracer.log(logger);
 
diff --git a/Minimum Spanning Tree/Kruskal's Algorithm/code.js b/Minimum Spanning Tree/Kruskal's Algorithm/code.js
@@ -1,4 +1,4 @@
-var tracer = new WeightedUndirectedGraphTracer();
+var tracer = new GraphTracer({ directed: false, weighted: true });
 var logger = new LogTracer();
 /*var G = [ // G[i][j] indicates the weight of the path from the i-th node to the j-th node
  [0, 3, 0, 1, 0],
@@ -7,7 +7,7 @@ var logger = new LogTracer();
  [0, 2, 0, 0, 1],
  [0, 1, 3, 0, 0]
  ];*/
-var G = WeightedUndirectedGraph.random(5, 1, 1, 9);
+var G = Randomize.graph(5, { directed: false, weighted: true, ratio: 1, min: 1, max: 9 });
 tracer.set(G);
 
 function kruskal() {
diff --git a/Minimum Spanning Tree/Prim's Algorithm/code.js b/Minimum Spanning Tree/Prim's Algorithm/code.js
@@ -1,4 +1,4 @@
-var tracer = new WeightedUndirectedGraphTracer();
+var tracer = new GraphTracer({ directed: false, weighted: true });
 var logger = new LogTracer();
 tracer.log(logger);
 /*var G = [ // G[i][j] indicates the weight of the path from the i-th node to the j-th node
@@ -8,7 +8,7 @@ tracer.log(logger);
  [0, 2, 0, 0, 1],
  [0, 1, 3, 0, 0]
  ];*/
-var G = WeightedUndirectedGraph.random(10, .4, 1, 9);
+var G = Randomize.graph(10, { directed: false, weighted: true, ratio: .4, min: 1, max: 9 });
 tracer.set(G);
 
 function prim() {
diff --git a/Search/Binary Search (Iterative)/code.js b/Search/Binary Search (Iterative)/code.js
@@ -1,7 +1,7 @@
 var chart = new ChartTracer();
 var tracer = new Array1DTracer().chart(chart);
 var logger = new LogTracer();
-var D = Array1D.randomSorted(15, 0, 50);
+var D = Randomize.array1D(15, { sorted: true, min: 0, max: 50 });
 tracer.set(D);
 
 function BinarySearch(array, element) { // array = sorted array, element = element to be found
@@ -43,7 +43,7 @@ function BinarySearch(array, element) { // array = sorted array, element = eleme
     return -1;
 }
 
-var element = D[Integer.random(0, D.length - 1)];
+var element = D[Randomize.integer(0, D.length - 1)];
 
 logger.print('Using iterative binary search to find ' + element);
 BinarySearch(D, element);
diff --git a/Search/Binary Search (Recursive)/code.js b/Search/Binary Search (Recursive)/code.js
@@ -1,7 +1,7 @@
 var chart = new ChartTracer();
 var tracer = new Array1DTracer().chart(chart);
 var logger = new LogTracer();
-var D = Array1D.randomSorted(15, 0, 50);
+var D = Randomize.array1D(15, { sorted: true, min: 0, max: 50 });
 tracer.set(D);
 
 function BinarySearch(array, element, minIndex, maxIndex) { // array = sorted array, element = element to be found, minIndex = low index, maxIndex = high index
@@ -39,7 +39,7 @@ function BinarySearch(array, element, minIndex, maxIndex) { // array = sorted ar
     return -1;
 }
 
-var element = D[Integer.random(0, D.length - 1)];
+var element = D[Randomize.integer(0, D.length - 1)];
 
 logger.print('Using binary search to find ' + element);
 BinarySearch(D, element, 0, D.length - 1);
diff --git a/Sorting/Bubble Sort/code.js b/Sorting/Bubble Sort/code.js
@@ -1,7 +1,7 @@
 var chart = new ChartTracer();
 var tracer = new Array1DTracer().chart(chart);
 var logger = new LogTracer();
-var D = Array1D.random(15);
+var D = Randomize.array1D(15);
 tracer.set(D);
 
 logger.print('original array = [' + D.join(', ') + ']');
diff --git a/Sorting/Bucket Sort/code.js b/Sorting/Bucket Sort/code.js
@@ -3,7 +3,7 @@ var arraySize = 10;
 var numBuckets = 5;
 
 //initialize array values
-var array = Array1D.random(arraySize, 0, maxValue - 1);
+var array = Randomize.array1D(arraySize, { min: 0, max: maxValue - 1 });
 var buckets = [];
 var bucketsCount = [];
 var sortedArray = [];
@@ -13,7 +13,7 @@ for (let i = 0; i < arraySize; i++) {
 		bucketsCount[i] = 0;
 	}
     sortedArray[i] = 0;
-}	
+}
 var D = [
     array,
     bucketsCount,
@@ -46,7 +46,7 @@ for (let k = 0; k < buckets.length; k++) {
 		}
 		buckets[k][j + 1] = key;
 	}
-	
+
 	//place ordered buckets into sorted array
 	for (let i = 0; i < buckets[k].length; i++) {
 		sortedArray[sortLocation] = buckets[k][i];
diff --git a/Sorting/Comb Sort/code.js b/Sorting/Comb Sort/code.js
@@ -1,7 +1,7 @@
 var chart = new ChartTracer();
 var tracer = new Array1DTracer().chart(chart);
 var logger = new LogTracer();
-var D = Array1D.random(15);
+var D = Randomize.array1D(15);
 tracer.set(D);
 
 logger.print('original array = [' + D.join(', ') + ']');
diff --git a/Sorting/Counting Sort/code.js b/Sorting/Counting Sort/code.js
@@ -2,7 +2,7 @@ var maxValue = 9;
 var arrSize = 10;
 
 //initialize array values
-var A = Array1D.random(arrSize, 0, maxValue);
+var A = Randomize.array1D(arrSize, { min: 0, max: maxValue });
 var counts = [];
 var sortedA = [];
 for (let i = 0; i <= maxValue; i++) {
diff --git a/Sorting/Cycle Sort/code.js b/Sorting/Cycle Sort/code.js
@@ -1,7 +1,7 @@
 var chart = new ChartTracer();
 var tracer = new Array1DTracer().chart(chart);
 var logger = new LogTracer();
-var D = Array1D.random(15);
+var D = Randomize.array1D(15);
 tracer.set(D);
 
 logger.print('original array = [' + D.join(', ') + ']');
diff --git a/Sorting/Heapsort/code.js b/Sorting/Heapsort/code.js
@@ -1,7 +1,7 @@
 var chart = new ChartTracer();
 var tracer = new Array1DTracer().chart(chart);
 var logger = new LogTracer();
-var D = Array1D.random(10);
+var D = Randomize.array1D(10);
 tracer.set(D);
 
 
diff --git a/Sorting/Insertion Sort/code.js b/Sorting/Insertion Sort/code.js
@@ -1,7 +1,7 @@
 var chart = new ChartTracer();
 var tracer = new Array1DTracer().chart(chart);
 var logger = new LogTracer();
-var D = Array1D.random(15);
+var D = Randomize.array1D(15);
 tracer.set(D);
 
 logger.print('original array = [' + D.join(', ') + ']');
diff --git a/Sorting/LSD Radix Sort/code.js b/Sorting/LSD Radix Sort/code.js
@@ -1,6 +1,6 @@
 var tracer = new Array2DTracer();
 var logger = new LogTracer();
-var k = Array1D.random(10, 1, 999);
+var k = Randomize.array1D(10, { min: 1, max: 999 });
 var D = [
     k,
     [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
diff --git a/Sorting/Merge Sort (Bottom-Up)/code.js b/Sorting/Merge Sort (Bottom-Up)/code.js
@@ -1,8 +1,8 @@
 var tracer = new Array2DTracer();
 var logger = new LogTracer();
 var D = [
-    Array1D.random(20, 0, 50),
-    Array1D.random(20, 0, 0)
+    Randomize.array1D(20, { min: 0, max: 50 }),
+    Randomize.array1D(20, { min: 0, max: 0 })
 ];
 
 tracer.set(D);
diff --git a/Sorting/Merge Sort (Top-Down)/code.js b/Sorting/Merge Sort (Top-Down)/code.js
diff --git a/Sorting/Pancake Sort/code.js b/Sorting/Pancake Sort/code.js
diff --git a/Sorting/Pigeonhole Sort/code.js b/Sorting/Pigeonhole Sort/code.js
diff --git a/Sorting/Quicksort/code.js b/Sorting/Quicksort/code.js
diff --git a/Sorting/Selection Sort/code.js b/Sorting/Selection Sort/code.js
diff --git a/Sorting/Shellsort/code.js b/Sorting/Shellsort/code.js
diff --git a/Tree/Binary Search Tree Searching/code.js b/Tree/Binary Search Tree Searching/code.js
diff --git a/Tree/Binary Tree Traversal (Inorder)/code.js b/Tree/Binary Tree Traversal (Inorder)/code.js
diff --git a/Tree/Binary Tree Traversal (Postorder)/code.js b/Tree/Binary Tree Traversal (Postorder)/code.js
diff --git a/Tree/Binary Tree Traversal (Preorder)/code.js b/Tree/Binary Tree Traversal (Preorder)/code.js
diff --git a/Tree/Lowest Common Ancestor/code.js b/Tree/Lowest Common Ancestor/code.js

Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,7 @@ function randString(length) {`
`3`	`3`	`var text = '';`
`4`	`4`
`5`	`5`	`for (var i = 0; i < length; i++) {`
`6`		`- text += choices[Integer.random(0, choices.length - 1)];`
	`6`	`+ text += choices[Randomize.integer(0, choices.length - 1)];`
`7`	`7`	`}`
`8`	`8`
`9`	`9`	`return text;`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-var D = Array2D.random(5, 5, 1, 5);`
	`1`	`+var D = Randomize.array2D(5, 5, { min: 1, max: 5 });`
`2`	`2`	`var dataViewer = new Array2DTracer().set(D);`
`3`	`3`	`var tracer = new Array2DTracer('Results Table');`
`4`	`4`	`var logger = new LogTracer();`