-
Notifications
You must be signed in to change notification settings - Fork 0
/
tinkering.js
70 lines (55 loc) · 1.55 KB
/
tinkering.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
// // This is where I tinker with different ideas and things
// // ******************************************************
// let arr = [];
// let target = Math.floor(Math.random() * 100 + 1);
// for (let i = 0; i < 100; i++) {
// let num = Math.floor(Math.random() * 100 + 1);
// arr.push(num);
// }
// console.log("\n Original arr:\n", " ", arr, "\n");
// const findNum = (arr, target) => {
// arr.sort((a,b) => a-b)
// console.log("\n sorted arr:\n", " ", arr, "\n");
// let start = 0;
// let end = arr.length;
// let result = "Not Found";
// while (end > start) {
// console.log("target: ", target);
// let guess = Math.floor((end - start)/2);
// console.log("guess: ", guess);
// console.log("start: ", start, "\nend: ", end);
// if (arr[guess] === target) {
// console.log('found: ', arr[guess]);
// result = arr[guess];
// return result;
// }
// if (arr[guess] < target) {
// start = guess;
// console.log('guess too small\n');
// }else if (arr[guess] > target) {
// end = guess;
// console.log('guess too big\n');
// }
// }
// return result;
// };
// console.log("findNum: ", findNum(arr, target));
// ****************************************
// Graphs Practice
// *****************************************
class Graph{
constructor() {
this.verticies= {}
}
// class methods
addVertex(vertId) {
this.verticies[vertId]= Set()
}
}
class TreeNode {
constructor(value) {
this.value = value;
this.left = null;
this.right = null;
}
}