JavaScript数组排序

1、冒泡排序

		var arr = [9, 87, 25, 63, 54, 2, 3, 8, 9, 3, 1]
        var temp = []
        for(j=0;j<arr.length-1;j++){
            for(i=0;i<arr.length-1-j;i++){
            if(arr[i]<arr[i+1]){
                temp=arr[i]
                arr[i]=arr[i+1]
                arr[i+1]=temp
            }
        }
        }
        console.log(arr)

2、选择排序

		var arr = [9, 87, 25, 63, 54, 2, 3, 8, 9, 3, 1]
        var temp = []
        for (k = 0; k < arr.length; k++) {
            var max = arr[k]
            for (i = 1 + k; i < arr.length; i++) {
                if (max < arr[i]) {
                    temp = max
                    max = arr[i]
                    arr[i] = temp
                }    
            }
            arr[k] = max
        }
        console.log(arr)

3、快速排序

var arr = [9, 87, 25, 63, 54, 2, 3, 8, 9, 3, 1]
        arr.sort(function(a,b){
            return b-a
        })
        console.log(arr)

实验截图：