Js in the bubble sort and quick sort

Bubble Sort　

var arr = [2,43,35463,232,2,645,4567,5];
            function bubbleSort(arr) {
                for (let i = 0 ; i < arr.length-1 ; i++) {
                    for (let j = 0 ; j < arr.length - 1 - i ; j++) {
                        if(arr[j] > arr[j+1]){
                            var temp = arr[j];
                            arr[j] = arr[j+1];
                            arr[j+1] = temp;
                        }
                    }
                }
            }
            bubbleSort(arr);
            console.log(arr);

 

 

2, quick sort

    var ARR = [ 2 , 43 is , 35463 , 232 , 2 , 645 , 4567 , . 5 ]; 
            function QUICKSORT (ARR) { 
                // benchmark 
                const Pivot ARR = [ 0 ];
                 // larger than the benchmark array 
                var Bigger = [] ;
                 // than the benchmark smaller 
                var smaller = [];
                 // stop condition recursion 
                IF (arr.length <= . 1 ) {
                     return ARR; 
                }
                
                for (let i = 1 ; i < arr.length ; i++) {
                    if (arr[i] >= pivot) {
                        bigger.push(arr[i]);
                    } else{
                        smaller.push(arr[i]);
                    }
                }
                return quickSort(smaller).concat(pivot,quickSort(bigger));
            }
            console.log(quickSort(arr));