-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmergeSort.js
95 lines (80 loc) · 2.31 KB
/
mergeSort.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
Array.prototype.mergeSort = function() {
function sort(array) {
var length = array.length,
mid = Math.floor(length * 0.5),
left = array.slice(0, mid),
right = array.slice(mid, length);
if(length === 1) {
return array;
}
return merge(sort(left), sort(right));
}
function merge(left, right) {
var result = []
for (var li=0,ri=0,i=0;i<left.length+right.length;i++){
if (li < left.length && ri < right.length) {
if (less(left[li], right[ri])) {
result[i]=left[li]
li++
continue
}
else {
result[i]=right[ri]
ri++
continue
}
}
if (li===left.length) {
result[i]=right[ri]
ri++
continue
}
else {
result[i]=left[li]
li++
continue
}
}
virtualize(result, 0)
return result
}
var newArray=sort(this)
return newArray
}
// Array.prototype.mergeSort2 = function() {
// function sort(array) {
// var length = array.length,
// mid = Math.floor(length * 0.5),
// left = array.slice(0, mid),
// right = array.slice(mid, length);
// if(length === 1) {
// return array;
// }
// return merge(sort(left), sort(right));
// }
// function merge(left, right) {
// var result = []
// while (left.length || right.length) {
// if (left[0] < right[0]) {
// result.push(left.shift());
// continue
// }
// if (left[0] >= right[0]) {
// result.push(right.shift());
// continue
// }
// if (left.length === 0) {
// result.push(right.shift());
// continue
// }
// if (right.length === 0) {
// result.push(left.shift());
// continue
// }
// }
// return result
// }
// var newArray=sort(this)
// this.splice(0,this.length,newArray)
// console.log(this)
// }