Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commitef46369

Browse files
committed
Adjust to the updated Randomize functions in tracers.js
1 parentf310721 commitef46369

File tree

38 files changed

+63
-55
lines changed

38 files changed

+63
-55
lines changed

‎Branch and Bound/Binary Search Tree/search.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@ const T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][
2828
[9,-1],
2929
];
3030

31-
constkey=newRandomize.Integer(0,G.length-1).create();// item to be searched
31+
constkey=Randomize.Integer({min:0,max:G.length-1});// item to be searched
3232
consttracer=newGraphTracer(' Binary Search Tree ');
3333
constlogger=newLogTracer(' Log ');
3434
Layout.setRoot(newVerticalLayout([tracer,logger]));

‎Branch and Bound/Binary Search/iterative.js

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
44
consttracer=newArray1DTracer();
55
constlogger=newLogTracer();
66
Layout.setRoot(newVerticalLayout([chart,tracer,logger]));
7-
constD=newRandomize.Array1D(15,newRandomize.Integer(0,50)).sorted().create();
7+
constD=Randomize.Array1D({N:15,value:()=>Randomize.Integer({min:0,max:50}),sorted:true});
88
tracer.set(D);
99
tracer.chart(chart);
1010
Tracer.delay();
@@ -44,7 +44,7 @@ function BinarySearch(array, element) { // array = sorted array, element = eleme
4444
return-1;
4545
}
4646

47-
constelement=D[newRandomize.Integer(0,D.length-1).create()];
47+
constelement=D[Randomize.Integer({min:0,max:D.length-1})];
4848

4949
logger.println(`Using iterative binary search to find${element}`);
5050
BinarySearch(D,element);

‎Branch and Bound/Binary Search/recursive.js

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
44
consttracer=newArray1DTracer();
55
constlogger=newLogTracer();
66
Layout.setRoot(newVerticalLayout([chart,tracer,logger]));
7-
constD=newRandomize.Array1D(15,newRandomize.Integer(0,50)).sorted().create();
7+
constD=Randomize.Array1D({N:15,value:()=>Randomize.Integer({min:0,max:50}),sorted:true});
88
tracer.set(D);
99
tracer.chart(chart);
1010
Tracer.delay();
@@ -46,7 +46,7 @@ function BinarySearch(array, element, minIndex, maxIndex) { // array = sorted ar
4646
return-1;
4747
}
4848

49-
constelement=D[newRandomize.Integer(0,D.length-1).create()];
49+
constelement=D[Randomize.Integer({min:0,max:D.length-1})];
5050

5151
logger.println(`Using binary search to find${element}`);
5252
BinarySearch(D,element,0,D.length-1);

‎Branch and Bound/Depth-Limited Search/code.js

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -37,4 +37,5 @@ function DLSCount(limit, node, parent) { // node = current node, parent = previo
3737
}
3838
returnchild;
3939
}
40+
4041
logger.println(`Number of descendant is${DLSCount(2,0)}`);

‎Brute Force/Breadth-First Search/shortestPath.js

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const tracer = new GraphTracer().directed(false).weighted();
44
constlogger=newLogTracer();
55
Layout.setRoot(newVerticalLayout([tracer,logger]));
66
tracer.log(logger);
7-
constG=newRandomize.Graph(5,1).directed(false).weighted().create();
7+
constG=Randomize.Graph({N:5,ratio:1,directed:false,weighted:true});
88
tracer.set(G);
99
Tracer.delay();
1010

@@ -36,10 +36,10 @@ function BFS() {
3636
returnW[e];
3737
}
3838

39-
lets=newRandomize.Integer(0,G.length-1).create();// s = start node
39+
lets=Randomize.Integer({min:0,max:G.length-1});// s = start node
4040
lete;// e = start node
4141
do{
42-
e=newRandomize.Integer(0,G.length-1).create();
42+
e=Randomize.Integer({min:0,max:G.length-1});
4343
}while(s===e);
4444
letMAX_VALUE=0x7fffffff;
4545
logger.println(`finding the shortest path from${s} to${e}`);

‎Brute Force/Breadth-First Search/tree.js

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -37,4 +37,5 @@ function BFS(s) { // s = start node
3737
}
3838
}
3939
}
40+
4041
BFS(0);

‎Brute Force/Bubble Sort/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
44
consttracer=newArray1DTracer();
55
constlogger=newLogTracer();
66
Layout.setRoot(newVerticalLayout([chart,tracer,logger]));
7-
constD=newRandomize.Array1D(15).create();
7+
constD=Randomize.Array1D({N:15});
88
tracer.set(D);
99
tracer.chart(chart);
1010
Tracer.delay();

‎Brute Force/Comb Sort/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
44
consttracer=newArray1DTracer();
55
constlogger=newLogTracer();
66
Layout.setRoot(newVerticalLayout([chart,tracer,logger]));
7-
constD=newRandomize.Array1D(15).create();
7+
constD=Randomize.Array1D({N:15});
88
tracer.set(D);
99
tracer.chart(chart);
1010
Tracer.delay();

‎Brute Force/Cycle Sort/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
44
consttracer=newArray1DTracer();
55
constlogger=newLogTracer();
66
Layout.setRoot(newVerticalLayout([chart,tracer,logger]));
7-
constD=newRandomize.Array1D(15).create();
7+
constD=Randomize.Array1D({N:15});
88
tracer.set(D);
99
tracer.chart(chart);
1010
Tracer.delay();

‎Brute Force/Depth-First Search/graph.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ const visitedTracer = new Array1DTracer('visited');
55
constlogger=newLogTracer();
66
Layout.setRoot(newVerticalLayout([graphTracer,visitedTracer,logger]));
77
graphTracer.log(logger);
8-
constG=newRandomize.Graph(8,.3).directed(false).create();
8+
constG=Randomize.Graph({N:8,ratio:.3,directed:false});
99
graphTracer.set(G);
1010
Tracer.delay();
1111

‎Brute Force/Depth-First Search/shortestPath.js

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const tracer = new GraphTracer().directed(false).weighted();
44
constlogger=newLogTracer();
55
Layout.setRoot(newVerticalLayout([tracer,logger]));
66
tracer.log(logger);
7-
constG=newRandomize.Graph(5,1).directed(false).weighted().create();
7+
constG=Randomize.Graph({N:5,ratio:1,directed:false,weighted:true});
88
tracer.set(G);
99
Tracer.delay();
1010

@@ -35,10 +35,10 @@ function DFS(node, parent, weight) { // node = current node, parent = previous n
3535
Tracer.delay();
3636
}
3737

38-
consts=newRandomize.Integer(0,G.length-1).create();// s = start node
38+
consts=Randomize.Integer({min:0,max:G.length-1});// s = start node
3939
lete;// e = end node
4040
do{
41-
e=newRandomize.Integer(0,G.length-1).create();
41+
e=Randomize.Integer({min:0,max:G.length-1});
4242
}while(s===e);
4343
constMAX_VALUE=Infinity;
4444
letminWeight=MAX_VALUE;

‎Brute Force/Depth-First Search/weightedGraph.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const tracer = new GraphTracer().directed(false).weighted();
44
constlogger=newLogTracer();
55
Layout.setRoot(newVerticalLayout([tracer,logger]));
66
tracer.log(logger);
7-
constG=newRandomize.Graph(5,1).directed(false).weighted().create();
7+
constG=Randomize.Graph({N:5,ratio:1,directed:false,weighted:true});
88
tracer.set(G);
99
Tracer.delay();
1010

‎Brute Force/Heapsort/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
44
consttracer=newArray1DTracer();
55
constlogger=newLogTracer();
66
Layout.setRoot(newVerticalLayout([chart,tracer,logger]));
7-
constD=newRandomize.Array1D(10).create();
7+
constD=Randomize.Array1D({N:10});
88
tracer.set(D);
99
tracer.chart(chart);
1010
Tracer.delay();

‎Brute Force/Insertion Sort/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
44
consttracer=newArray1DTracer();
55
constlogger=newLogTracer();
66
Layout.setRoot(newVerticalLayout([chart,tracer,logger]));
7-
constD=newRandomize.Array1D(15).create();
7+
constD=Randomize.Array1D({N:15});
88
tracer.set(D);
99
tracer.chart(chart);
1010
Tracer.delay();

‎Brute Force/PageRank/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ function filledArray(length, value) {
44
returnArray(...Array(length)).map(Number.prototype.valueOf,value);
55
}
66

7-
constG=newRandomize.Graph(5,.4).create();
7+
constG=Randomize.Graph({N:5,ratio:.4});
88
letranks;
99
constoutgoingEdgeCounts=filledArray(G.length,0);
1010
letincomingNodes;

‎Brute Force/Pancake Sort/code.js

Lines changed: 7 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,13 +4,14 @@ const chart = new ChartTracer();
44
consttracer=newArray1DTracer();
55
constlogger=newLogTracer();
66
Layout.setRoot(newVerticalLayout([chart,tracer,logger]));
7-
constD=newRandomize.Array1D(10).create();
7+
constD=Randomize.Array1D({N:10});
88
tracer.set(D);
99
tracer.chart(chart);
1010
Tracer.delay();
1111

1212
logger.println(`original array = [${D.join(', ')}]`);
1313
constN=D.length;
14+
1415
functionflip(start){
1516
tracer.select(start,N-1);
1617
Tracer.delay();
@@ -31,10 +32,14 @@ function flip(start) {
3132
}
3233
tracer.deselect(start,N-1);
3334
}
35+
3436
for(leti=0;i<N-1;i++){
3537
logger.println(`round${i+1}`);
3638
constcurrArr=D.slice(i,N);
37-
constcurrMax=currArr.reduce((prev,curr,idx)=>((curr>prev.val) ?{ idx,val:curr} :prev),{idx:0,val:currArr[0]});
39+
constcurrMax=currArr.reduce((prev,curr,idx)=>((curr>prev.val) ?{ idx,val:curr} :prev),{
40+
idx:0,
41+
val:currArr[0],
42+
});
3843
if(currMax.idx!==0){// if currMax.idx === 0 that means max element already at the bottom, no flip required
3944
logger.println(`flip at${currMax.idx+i} (step 1)`);
4045
flip(currMax.idx+i,N);

‎Brute Force/Selection Sort/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
44
consttracer=newArray1DTracer();
55
constlogger=newLogTracer();
66
Layout.setRoot(newVerticalLayout([chart,tracer,logger]));
7-
constD=newRandomize.Array1D(15).create();
7+
constD=Randomize.Array1D({N:15});
88
tracer.set(D);
99
tracer.chart(chart);
1010
Tracer.delay();

‎Brute Force/Shellsort/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
44
consttracer=newArray1DTracer();
55
constlogger=newLogTracer();
66
Layout.setRoot(newVerticalLayout([chart,tracer,logger]));
7-
constD=newRandomize.Array1D(15).create();
7+
constD=Randomize.Array1D({N:15});
88
tracer.set(D);
99
tracer.chart(chart);
1010
Tracer.delay();

‎Divide and Conquer/Bucket Sort/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ Layout.setRoot(new VerticalLayout([chartTracer, arrayTracer, bucketsTracer]));
1212
// define input variables
1313
constN=25;// the size of an array
1414
constK=5;// the number of buckets
15-
constarray=newRandomize.Array1D(N,newRandomize.Integer(0,999)).create();
15+
constarray=Randomize.Array1D({N,value:()=>Randomize.Integer({min:0,max:999})});
1616

1717
(functionmain(){
1818
// create K buckets

‎Divide and Conquer/Counting Sort/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ Layout.setRoot(new VerticalLayout([arrayTracer, countsTracer, sortedArrayTracer]
1111

1212
// define input variables
1313
constN=20;// the size of an array
14-
constarray=newRandomize.Array1D(N,newRandomize.Integer(0,9)).create();
14+
constarray=Randomize.Array1D({N,value:()=>Randomize.Integer({min:0,max:9})});
1515

1616
(functionmain(){
1717
// find the maximum value that will decide the size of counts array

‎Divide and Conquer/Merge Sort/bottomUp.js

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,8 +4,8 @@ const tracer = new Array2DTracer();
44
constlogger=newLogTracer();
55
Layout.setRoot(newVerticalLayout([tracer,logger]));
66
constD=[
7-
newRandomize.Array1D(20,newRandomize.Integer(0,50)).create(),
8-
newRandomize.Array1D(20,newRandomize.Integer(0,0)).create(),
7+
Randomize.Array1D({N:20,value:()=>Randomize.Integer({min:0,max:50})}),
8+
Randomize.Array1D({N:20,value:()=>Randomize.Integer({min:0,max:0})}),
99
];
1010

1111
tracer.set(D);

‎Divide and Conquer/Merge Sort/topDown.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
44
consttracer=newArray1DTracer();
55
constlogger=newLogTracer();
66
Layout.setRoot(newVerticalLayout([chart,tracer,logger]));
7-
constD=newRandomize.Array1D(15).create();
7+
constD=Randomize.Array1D({N:15});
88
tracer.set(D);
99
tracer.chart(chart);
1010
Tracer.delay();

‎Divide and Conquer/Pigeonhole Sort/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
const{ Tracer, Array1DTracer, Array2DTracer, LogTracer, Randomize, Layout, VerticalLayout}=require('algorithm-visualizer');
22

3-
constA=newRandomize.Array1D(7).create();
3+
constA=Randomize.Array1D({N:7});
44
constN=A.length;
55

66
consttracer1=newArray1DTracer('Array');

‎Divide and Conquer/Quicksort/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const chart = new ChartTracer();
44
consttracer=newArray1DTracer();
55
constlogger=newLogTracer();
66
Layout.setRoot(newVerticalLayout([chart,tracer,logger]));
7-
constD=newRandomize.Array1D(15).create();
7+
constD=Randomize.Array1D({N:15});
88
tracer.set(D);
99
tracer.chart(chart);
1010
Tracer.delay();

‎Divide and Conquer/Radix Sort/leastSignificantDigit.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ const { Tracer, Array2DTracer, LogTracer, Randomize, Layout, VerticalLayout } =
33
consttracer=newArray2DTracer();
44
constlogger=newLogTracer();
55
Layout.setRoot(newVerticalLayout([tracer,logger]));
6-
constk=newRandomize.Array1D(10,newRandomize.Integer(1,999)).create();
6+
constk=Randomize.Array1D({N:10,value:()=>Randomize.Integer({min:1,max:999})});
77
constD=[
88
k,
99
[0,0,0,0,0,0,0,0,0,0],

‎Dynamic Programming/Bellman-Ford's Shortest Path/code.js

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const tracer = new GraphTracer().weighted();
44
constlogger=newLogTracer();
55
Layout.setRoot(newVerticalLayout([tracer,logger]));
66
tracer.log(logger);
7-
constG=newRandomize.Graph(5,.5,newRandomize.Integer(-2,5)).weighted().create();
7+
constG=Randomize.Graph({N:5,ratio:.5,value:()=>Randomize.Integer({min:-2,max:5}),weighted:true});
88
tracer.set(G);
99
Tracer.delay();
1010

@@ -66,7 +66,7 @@ function BELLMAN_FORD(src, dest) {
6666
returnweights[dest];
6767
}
6868

69-
constsrc=newRandomize.Integer(0,G.length-1).create();
69+
constsrc=Randomize.Integer({min:0,max:G.length-1});
7070
letdest;
7171
letMAX_VALUE=0x7fffffff;
7272
letminWeight;
@@ -77,7 +77,7 @@ let minWeight;
7777
*/
7878

7979
do{
80-
dest=newRandomize.Integer(0,G.length-1).create();
80+
dest=Randomize.Integer({min:0,max:G.length-1});
8181
}
8282
while(src===dest);
8383

‎Dynamic Programming/Floyd-Warshall's Shortest Path/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ const tracer = new GraphTracer().weighted();
44
constlogger=newLogTracer();
55
Layout.setRoot(newVerticalLayout([tracer,logger]));
66
tracer.log(logger);
7-
constG=newRandomize.Graph(5,1).weighted().create();
7+
constG=Randomize.Graph({N:5,ratio:1,weighted:true});
88
tracer.set(G);
99
Tracer.delay();
1010

‎Dynamic Programming/Integer Partition/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ const { Tracer, Array2DTracer, LogTracer, Randomize, Layout, VerticalLayout } =
33
consttracer=newArray2DTracer();
44
constlogger=newLogTracer();
55
Layout.setRoot(newVerticalLayout([tracer,logger]));
6-
constinteger=newRandomize.Integer(5,14).create();
6+
constinteger=Randomize.Integer({min:5,max:14});
77
constD=[];
88
constA=[];
99
for(leti=0;i<=integer;i++){

‎Dynamic Programming/Longest Increasing Subsequence/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ const { Tracer, Array1DTracer, LogTracer, Randomize, Layout, VerticalLayout } =
33
consttracer=newArray1DTracer();
44
constlogger=newLogTracer();
55
Layout.setRoot(newVerticalLayout([tracer,logger]));
6-
constA=newRandomize.Array1D(10,newRandomize.Integer(0,10)).create();
6+
constA=Randomize.Array1D({N:10,value:()=>Randomize.Integer({min:0,max:10})});
77
constLIS=newArray(A.length);
88
tracer.set(A);
99
Tracer.delay();

‎Dynamic Programming/Longest Palindromic Subsequence/code.js

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -30,6 +30,7 @@ function max(a, b) {
3030
}
3131
returnb;
3232
}
33+
3334
logger.println('LPS for any string with length = 1 is 1');
3435
for(i=2;i<=N;i++){
3536
logger.println('--------------------------------------------------');

‎Dynamic Programming/Maximum Sum Path/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
const{ Tracer, Array2DTracer, LogTracer, Randomize, Layout, VerticalLayout}=require('algorithm-visualizer');
22

3-
constD=newRandomize.Array2D(5,5,newRandomize.Integer(1,5)).create();
3+
constD=Randomize.Array2D({N:5,M:5,value:()=>Randomize.Integer({min:1,max:5})});
44
constdataViewer=newArray2DTracer();
55
consttracer=newArray2DTracer('Results Table');
66
constlogger=newLogTracer();

‎Dynamic Programming/Sliding Window/code.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ const { Tracer, Array1DTracer, LogTracer, Randomize, Layout, VerticalLayout } =
33
consttracer=newArray1DTracer();
44
constlogger=newLogTracer();
55
Layout.setRoot(newVerticalLayout([tracer,logger]));
6-
constD=newRandomize.Array1D(20,newRandomize.Integer(-5,5)).create();
6+
constD=Randomize.Array1D({N:20,value:()=>Randomize.Integer({min:-5,max:5})});
77
tracer.set(D);
88
Tracer.delay();
99

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp