function bubbleSort(arr,order){

    let len = arr.length-1,flag=true

    for(let i=0;(i<len)&&flag;i++){

        flag=false

        for(let j=0;j<len-i;j++){

            if((arr[j]-arr[j+1])*order>0){

                flag=true

                let tran = arr[j]

                arr[j]=arr[j+1]

                arr[j+1]=tran

            }

        }

    }

}

let arr=[2,3,0,5,1,6,8,4]

bubbleSort(arr,1)

console.log(arr)

function insertSort(arr){

    let len=arr.length-1

    for(let i=1;i<len;i++){

        let currrent=arr[i],j

        for(j=i-1;j>=0&&arr[j]>currrent;j--){

            arr[j+1]=arr[j]

        }

        arr[j+1]=currrent

    }

}

let arr=[2,3,0,5,1,6,-6,4]

insertSort(arr)

console.log(arr)

function quickSort(arr,low,high){

  if(low>high) return

  let mid=partition(arr,low,high)

  quickSort(arr,low,mid-1)

  quickSort(arr,mid+1,high)

}

function partition(arr,low,high){

    for(i=low,j=low;j<high;j++){

        if(arr[j]<arr[high]){

            swap(arr,i++,j)

        }

    }

    swap(arr,i,j)

    return i

}

function swap(arr,i,j){

    let tran=arr[i]

    arr[i]=arr[j]

    arr[j]=tran

}

let arr=[2,3,0,5,1,6,8,4]

quickSort(arr,0,arr.length-1)

console.log(arr)

function mergeSort(arr,low,high){

    if(low>=high) return

    let mid = Math.floor((low+high)/2)

    mergeSort(arr,low,mid)

    mergeSort(arr,mid+1,high)

    merge(arr,low,mid,high)

}

function merge(arr,low,mid,high){

    let k=low,i=low,j=mid+1

    let copy=[...arr]

    while(k<=high){

        if(i>mid){

            arr[k++]=copy[j++]

        }else if(j>high){

            arr[k++]=copy[i++]

        }else if(copy[i]>copy[j]){

            arr[k++]=copy[j++]

        }else {

            arr[k++]=copy[i++]

        }

    }

}

let arr=[2,3,0,5,1,6,8,4]

mergeSort(arr,0,arr.length-1)

console.log(arr)

function heapify(arr,i,high){

    if(i>=high) return

    let left=2*i+1

    let right =2*i+2

    let max=i

    if((left<high)&&(arr[max]<arr[left])) max =left

    if((right<high)&&(arr[max]<arr[right])) max =right

    if(i!=max){

      swap(arr,i,max)

      heapify(arr,max,high)

    }

}

function buildHeap(arr){

  let high = arr.length

  for(let m=Math.floor(high/2);m>=0;m--){

    heapify(arr,m,high)

  }

}

function heapSort(arr){

    buildHeap(arr)

    let high=arr.length

    let j=high-1

    for(let i=0;i<high;i++){

        swap(arr,0,j)

        heapify(arr,0,j--)

    }

}

function swap(arr,i,j){

    let tran = arr[i]

    arr[i]= arr[j]

    arr[j]= tran

}

arr=[2,-1,7,6,5,12]

heapSort(arr)

console.log(arr)

function sort(arr,order){

    arr.sort((a,b)=>{

        return (a-b)*order

    })

}

let arr=[2,3,0,5,1,6,8,4]

sort(arr,-1)

console.log(arr)