JavaScript实现排序算法

冒泡

   <script>
        function randArray(len, min, max) {
            return Array.from({
                length: len
            }, v => Math.floor(Math.random() * (max - min)) + min);
        }
        var arr =  randArray(100,0,500);
// 小到大
        function BubbleSort(arr){
            for(let i=0;i<arr.length;i++){
                for(let j=i+1;j<arr.length;j++){
                    if(arr[j]<arr[i]){
                        let temp = arr[j];
                        arr[j] = arr[i];
                        arr[i] = temp;
                    }
                }
            }
            return arr;
        }
        console.log(BubbleSort(arr));
    </script>

快排

        function quickSort(arr){
            sortArray(arr,0,arr.length-1);
            return arr;
        };
        function sortArray(arr,low,high){
            if(low<high){ 
                let index = partition(arr,low,high);
            sortArray(arr,low,index-1);
            sortArray(arr,index+1,high);
        }
           
        };
        function partition(arr,low,high){
            let temp = arr[low];
            while(low<high){
                while(low<high&&arr[high]>=temp) high--;
                if(low<high) arr[low] = arr[high];
                while(low<high&&arr[low]<=temp) low++;
                if(low<high) arr[high] = arr[low];
            }
            arr[low] = temp;
            return low;
        };