js冒泡排序

/*
            值交换函数swap()        
*/
        var array = [1,2];
        function swap(arr,a,b)
        {            
            var temp = arr[a];
            arr[a] = arr[b];
            arr[b] = temp;                
        }
        swap(array,0,1);
        document.write(array[0]+"<br>");
        document.write(array[1]+"<br>");

        //3个数的冒泡排序 每次拿第一个数和后面的数比较
        function sort3(){
            var  a = 3, b = 9, c = 8, temp;
            document.write("交换前 a = "+a+" b = "+b+" c = "+c+"<br>");
            if(a > b){
                temp = a;
                a = b;
                b = temp;
            }
            if(a > c){
                temp = a;
                a = c;
                c = temp;
            }
            if (b > c){
                temp = b;
                b = c;
                c = temp;
            }
            document.write("交换后 a = "+a+" b = "+b+" c = "+c);
        }
        sort3();

        //冒泡排序每次循环会得出一个最大值沉到最后
        var array = [1,5,7,9,11,8,3,10];

        function bubbleSort1(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;
        }

        document.write("<br> array = [1,5,7,9,11,8,3,10] 排序后"+bubbleSort1(array)+"<br>");

        //翻转数组
        function reverseArray(oldArray){
            var newArray = [];
            for(var i = oldArray.length - 1; i >= 0; i--){
                newArray[newArray.length] = oldArray[i];
            }
            return newArray;
        }
        var oldArray = [2, 5, 9, 1, 4, 0];
        document.write("oldArray = [2, 5, 9, 1, 4, 0]<br> newArray = "+reverseArray(oldArray ));


        //已经排好序的数组若想实现倒序反转可以强制两两交换
        array1 = [1,5,6,9,11,8,3,10]
        function bubbleSort2(arr){
            document.write("<br>");
            document.write("未排序的数组 "+arr);
            var i = arr.length,j;
            var temp;
            while(i > 0){
                for(j = 0; j < i - 1; j++){
                    if(arr[j]>arr[j+1]){
                        swap(arr,j,j+1);
                    }                    
                }
                i--;
            }
            document.write("<br>");
            document.write("翻转前的数组 "+arr);
            for(var i = 0; i <= arr.length - 1; i++){
                for(var j = 0; j < arr.length - 1- i; j++){
                    swap(arr,j,j+1);//相邻数据互换位置
                }
            }
            document.write("<br>");
            document.write("反转后的数组 "+arr);
            document.write("<br>");
            return arr;
        }
        document.write("array1 = [1,5,6,9,11,8,3,10] 排序后"+bubbleSort2(array1)+"<br>");


        arr = [3, 4, 7, 9, 2, 80, 20, 8];
        function bubbleSort3(arr){
            var q1 = 0;
            var q2 = 0;
            for(var i = 0; i < arr.length ; i++){
                for(var j = 0; j < arr.length; j++){
                    var temp;
                    if(arr[j] > arr[j+1]){
                        temp = arr[j];
                        arr[j] = arr[j+1];
                        arr[j+1] = temp; 
                    }
                    q1++;
                }
                q2++;
            }
            document.write("内层循环次数："+q1+"<br>");
            document.write("外层循环次数："+q2+"<br>");
            return arr;
        }
        document.write("arr = [3, 4, 7, 9, 2, 80, 20, 8] ="+bubbleSort3(arr));


        arr4 = [3, 4, 7, 9, 2, 80, 20, 8];
        function bubbleSort4(arr){
            var q1 = 0;
            var q2 = 0;
            for(var i = 0; i < arr.length ; i++){
                for(var j = 0; j < arr.length - i; j++){
                    var temp;
                    if(arr[j] > arr[j+1]){
                        temp = arr[j];
                        arr[j] = arr[j+1];
                        arr[j+1] = temp; 
                    }
                    q1++;
                }
                q2++;
            }
            document.write("<br>内层循环次数："+q1+"<br>");
            document.write("外层循环次数："+q2+"<br>");
            return arr;
        }
        document.write("arr4 = [3, 4, 7, 9, 2, 80, 20, 8] ="+bubbleSort4(arr4));



        arr5 = [3, 4, 7, 9, 2, 80, 20, 8];
        function bubbleSort5(arr){
            var q1 = 0;
            var q2 = 0;
            for(var i = 0; i < arr.length ; i++){
                for(var j = 0; j < arr.length - i -1; j++){
                    var temp;
                    if(arr[j] > arr[j+1]){
                        temp = arr[j];
                        arr[j] = arr[j+1];
                        arr[j+1] = temp; 
                    }
                    q1++;
                }
                q2++;
            }
            document.write("<br>内层循环次数："+q1+"<br>");
            document.write("外层循环次数："+q2+"<br>");
            return arr;
        }
        document.write("arr5 = [3, 4, 7, 9, 2, 80, 20, 8] ="+bubbleSort5(arr5));

        arr6 = [3, 4, 7, 9, 2, 80, 20, 8];
        function bubbleSort6(arr){
            var q1 = 0;
            var q2 = 0;
            for(var i = 0; i < arr.length ; i++){
                var isSort = true;
                for(var j = 0; j < arr.length - i - 1; j++){
                    var temp;
                    if(arr[j] > arr[j+1]){
                        isSort = false;
                        temp = arr[j];
                        arr[j] = arr[j+1];
                        arr[j+1] = temp; 
                    }
                    q1++;
                }
                q2++;
                if(isSort == true){
                    break;
                }
            }
            document.write("<br>内层循环次数："+q1+"<br>");
            document.write("外层循环次数："+q2+"<br>");
            return arr;
        }
        document.write("arr6 = [3, 4, 7, 9, 2, 80, 20, 8] ="+bubbleSort6(arr6));


        //求一组数组中的数的最大值最小值及他们的索引
        var array = [1, 2, 3, 14, 5, 6, 17, 8, 9, 10];
        var max = array[0];
        var maxIndex = 0;
        var min = array[0];
        var minIndex = 0;
        for (var i =0; i < array.length; i++){
            if(max < array[i]){
                max = array[i];
                maxIndex = i;
            }
            if(min > array[i]){
                min = array[i];
                minIndex = i;
            }
        }

        console.log("数组中的最大值是 "+max+" 最大值的索引是 "+maxIndex);
        console.log("数组中的最小值是 "+min+" 最小值的索引是 "+minIndex);