SOURCE

function bubsort(arr = []) {
    let length = arr.length
    let swaped
    do{
        swaped = false
        for(let i = 0; i< length-1;i++){
            if (arr[i] > arr[i+1]) {
                [arr[i], arr[i+1]] = [arr[i+1], arr[i]]
                swaped = true
            }
        }
        length--
    }while(swaped)
    console.log(arr)
}
const testData = [22,11,13,122,33,221]
bubsort(testData)
//quicksort
function quickSort(arr = []) {
    if(arr.length<=1) return arr
    const pivot = arr[0]
    const left = arr.slice(1).filter(el => el < pivot)
    const right = arr.slice(1).filter(el => el >= pivot)
    return [...quickSort(left), pivot, ...quickSort(right)]
}