-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathadd.js
More file actions
134 lines (128 loc) · 3.13 KB
/
Copy pathadd.js
File metadata and controls
134 lines (128 loc) · 3.13 KB
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
var add = function () {
var sum = 0;
for(var i in arguments){
if(typeof arguments[i] === "number"){
sum += arguments[i];
}
}
return sum;
};
var sort_choose = function (arr) {
if(arr.length > 1){
for(var i = 0;i<arr.length-1; i++){
var pos = i;
for(var j = i+1;j<arr.length; j++){
if(arr[pos] > arr[j]){
pos = j;
}
}
arr = wrap(arr,i,pos);
}
return arr;
}else {
return arr;
}
};
var sort_bubble = function (arr) {
if(arr.length > 1){
for(var i = 0;i<arr.length-1; i++){
for(var j = 1;j<arr.length-i; j++){
if(arr[j-1] > arr[j]){
wrap(arr,j-1,j);
}
}
}
return arr;
}else {
return arr;
}
};
var sort_insert = function (arr) {
if(arr.length > 1){
for(var j = 1;j<arr.length; j++){
var temp = arr[j];
var k = j-1;
while(arr[k] > arr[j] && k > -1){
k--;
}//插在k+1位置上
for(var t = j-1; t>k; t--){
arr[t+1] = arr[t];
}
arr[k+1] = temp;
}
return arr;
}else {
return arr;
}
};
function sortInsert(arr) {
var sArr = arr.slice(0);
for (var i = 1; i < sArr.length; i++) {
var temp = sArr[i];
for (var j = i; j > 0 && temp < sArr[j - 1]; j--) {
sArr[j] = sArr[j - 1];
}
sArr[j] = temp;
}
return sArr;
}
var sort_insert_binary = function (arr) {
if(arr.length > 1){
for(var j = 1;j<arr.length; j++){
var temp = arr[j];
var right = j-1;
var left = 0;
var mid;
while(right >= left){
mid = Math.floor((left+right)/2);
if(temp > arr[mid]){
left = mid+1;
}else{
right = mid-1;
}
}
for(var t = j-1; t > right; t--){
arr[t+1] = arr[t];
}
arr[left] = temp;
}
return arr;
}else {
return arr;
}
};
var sort_quik = function (arr,left,right) {
if(left < right){
var pos = change_quik(arr,left,right);
sort_quik(arr,left,pos);
sort_quik(arr,pos+1,right);
}
return arr;
};
var change_quik = function (arr,left,right) {
var pos = left;
var temp = arr[left];
for(var i = left+1 ;i < right; i++){
if(arr[i]<temp){
pos++;
wrap(arr,pos,i);
}
}
arr[left] = arr[pos];
arr[pos] = temp;
return pos;
};
var wrap = function (arr,a,b) {
if(a == b){
return arr;
}
if(a<arr.length&&b<arr.length){
var temp;
temp = arr[a] ;
arr[a] = arr[b];
arr[b] = temp;
return arr;
}else{
return 'index out of arr! please check.'
}
};