冒牌、选择、插入排序算法 

 1 <!DOCTYPE html>
 2 <html lang="en">
 3 <head>
 4     <meta charset="UTF-8">
 5     <title>Document</title>
 6 </head>
 7 <body>
 8     
 9     <script type="text/javascript">
10         function bubbleSort(arr) {
11             for (let i = 0; i < arr.length - 1; i++) {
12                 for (let j = 0; j < arr.length - 1 - i; j++) {
13                     if (arr[j] > arr[j+1]) {
14                         let temp = arr[j];
15                         arr[j] = arr[j+1];
16                         arr[j+1] = temp;
17                     }
18                 }
19             }
20             return arr;
21         }
22         function selectSort(arr) {
23             for (let i = 0; i < arr.length - 1; i++) {
24                 let k = i;
25                 for (let j = i + 1; j < arr.length; j++) {
26                     if (arr[j] < arr[k]) {
27                         k = j;
28                     }
29                 }
30                 if (k != i) {
31                     let temp = arr[i];
32                     arr[i] = arr[k];
33                     arr[k] = temp;
34                 }
35             }
36             return arr;
37         }
38         function insertSort(arr) {
39             for (let i = 1; i < arr.length; i++) {
40                 let temp = arr[i];
41                 let j = i - 1;
42                 while (j >= 0 && temp < arr[j]) {
43                     arr[j+1] = arr[j];
44                     j--;
45                 }
46                 arr[j+1] = temp;
47             }
48             return arr;
49         }
50         let arr = [3, 5, 2, 4, 10, 6];
51         console.log(bubbleSort(arr))
52         console.log(selectSort(arr))
53         console.log(insertSort(arr))
54     </script>
55     <style type="text/css">
56         
57     </style>
58 </body>
59 </html>

 

posted @ 2018-05-24 09:05  yxz_turing  阅读(220)  评论(0)    收藏  举报