javascript版快速排序和冒泡排序

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
var sort = (function () {
           //快速排序
           var quickSort = {
               partition: function (array, low, high) {
                   if (low >= high) {
                       return;
                   }
                   var key = array[high];
                   var middle = low;
                   for (var i = low; i < high; i++) {
                       if (array[i] < key) {
                           if (i != middle) {
                               var tmp = array[middle];
                               array[middle] = array[i];
                               array[i] = tmp;
                           }
                           middle++;
                       }
                   }
 
                   var tmp = array[high];
                   array[high] = array[middle];
                   array[middle] = tmp;
 
                   return middle;
               },
 
               sort: function (array, low, high) {
 
                   if (low < high) {
                       var middle = quickSort.partition(array, low, high);
                       quickSort.sort(array, low, middle - 1);
                       quickSort.sort(array, middle + 1, high);
                   }
               }
           };
 
           //冒泡排序
           bubbleSort = function (arr) {
               var i = arr.length, j;
               var temp;
               while (i > 0) {
                   for (j = 0; j < i - 1; j++) {
                       if (arr[j] > arr[j + 1]) {
                           temp = arr[j];
                           arr[j] = arr[j + 1];
                           arr[j + 1] = temp;
                       }
                   }
                   i--;
               }
               return arr;
 
           };
 
           return {
               quickSort: quickSort.sort,
               bubbleSort: bubbleSort
           };
 
       })();
       var array = [0, 2, 7, 4, 3, 5, 1, 6];
        
       sort.quickSort(array, 0, array.length);
 
       sort.bubbleSort(array);
 
       alert(array.toString());

javascript版快速排序和冒泡排序,古老的榕树,5-wow.com

郑重声明:本站内容如果来自互联网及其他传播媒体,其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享,并不代表本站赞同其观点和对其真实性负责,也不构成任何其他建议。