-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAlgorithm.js
153 lines (149 loc) · 2.72 KB
/
Algorithm.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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
module.exports = {
binarySearch: binarySearch,
binaryInsert: binaryInsert,
mergeSort: mergeSort
};
function binarySearch(A, B) {
var low = 0;
var high = A.length - 1;
var mid;
while (low <= high) {
mid = low + ((high - low) >> 1);
if (B === A[mid]) {
return mid;
}
else if (B > A[mid]) {
low = mid + 1;
}
else {
high = mid - 1;
}
}
return null;
}
function binaryInsert(A, B) {
if (A.length === 0) {
return [B];
}
if (B <= A[0]) {
A.splice(0, 0, B);
return A;
}
if (B > A[A.length - 1]) {
A.push(B);
return A;
}
var low = 0;
var high = A.length - 1;
var mid;
while (low <= high) {
mid = low + ((high - low) >> 1);
if (B === A[mid]) {
A.splice(mid, 0, B);
return A;
}
else if (B > A[mid]) {
low = mid + 1;
}
else {
high = mid - 1;
}
}
if (B <= A[low]) {
A.splice(low, 0, B);
}
else {
A.splice(low + 1, 0, B);
}
return A;
}
function mergeSort(A) {
if (A.length <= 1) {
return A;
}
var mid = A.length >> 1;
var left = new Array(mid);
var right = new Array(A.length - mid);
for (var i = 0; i < mid; i++) {
left[i] = A[i];
}
for (var i = mid; i < A.length; i++) {
right[i - mid] = A[i];
}
left = mergeSort(left);
right = mergeSort(right);
var result = new Array(A.length);
var l = 0;
var r = 0;
while (l < left.length && r < right.length) {
if (left[l] <= right[r]) {
result[l + r] = left[l];
l++;
}
else {
result[l + r] = right[r];
r++;
}
}
while (l < left.length) {
result[l + r] = left[l];
l++;
}
while (r < right.length) {
result[l + r] = right[r];
r++;
}
return result;
}
function isEqual (a, b) {
var caseSensitive = false;
if (a === undefined || b === undefined) {
return a === b;
}
else if (a === null || b === null) {
return a === b;
}
else if (typeof a === 'string' || typeof b === 'string') {
if (typeof a === 'string' && typeof b === 'string') {
if (!caseSensitive) {
return a.toLowerCase() === b.toLowerCase();
}
}
return a === b;
}
else if (typeof a === 'number' || typeof b === 'number') {
return a === b;
}
else if (a instanceof Date && b instanceof Date) {
return a.getTime() === b.getTime();
}
else if (Array.isArray(a) && Array.isArray(b)) {
if (a.length !== b.length) {
return false;
}
for (var i = 0; i < a.length; i++) {
if (!isEqual(a[i], b[i])) {
return false;
}
}
return true;
}
else if (a instanceof Object && !Array.isArray(a) && b instanceof Object && !Array.isArray(b)) {
for (var key in a) {
if (a.hasOwnProperty(key)) {
if (!isEqual(a[key], b[key])) {
return false;
}
}
}
for (key in b) {
if (b.hasOwnProperty(key)) {
if (!isEqual(a[key], b[key])) {
return false;
}
}
}
return true;
}
return a === b;
}