-
Notifications
You must be signed in to change notification settings - Fork 17
/
js_sortAalgorithm.html
68 lines (68 loc) · 1.53 KB
/
js_sortAalgorithm.html
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
<!DOCTYPE html>
<html>
<head>
<meta charset="UTF-8">
<title>js排序算法熟悉</title>
</head>
<body>
<script type="text/javascript">
/*插入排序*/
function insertSort(arr){
var arrLen=arr.length;
for(var i=0;i<arrLen;i++){
var index=0;
for(var j=1;j<arrLen-i;j++){
if(arr[j]>arr[index]) index=j;
}
var temp=arr[arrLen-i-1];
arr[arrLen-i-1]=arr[index];
arr[index]=temp;
}
return arr;
}
/*冒泡排序*/
function bubbleSort(arr){
for(var i=0;i<arr.length;i++){
for(var j=0;i<arr.length-i-1;i++){
if(arr[j]>arr[j+1]){
var temp=arr[j+1];
arr[j+1]=arr[j];
arr[j]=temp;
}
}
}
return arr;
}
/*快速排序(常用)*/
function quickSort(arr){
if (arr.length <= 1) { return arr; }
var index=Math.floor(arr.length/2);
var center=arr.splice(index,1)[0];
var left=[],right=[];
for(var i=0;i<arr.length;i++){
arr[i]<center ? left.push(arr[i]) : right.push(arr[i]);
}
return quickSort(left).concat([center],quickSort(right));
}
/*javascrip封装好的排序处理方法*/
function encapSortFunc(arr){
var posiSeq,reverseSeq;
//正序
posiSeq=arr.sort(function(a,b){
return a-b;
});
//反序
reverseSeq=arr.sort(function(a,b){
return b-a;
});
return posiSeq,reverseSeq;
}
var array=[1,31,2,5,10];//数组长度排除为1
console.log(insertSort(array));
console.log(bubbleSort(array));
console.log(encapSortFunc(array));
var arr1=quickSort(array);
console.log(arr1);
</script>
</body>
</html>