fill.ts

// merge sort



const mergeSortWrapper = () =>{

let xArr = [2,4,5,1];

const mergeSort = (s: number, e: number) =>{
    if (s ==e ) return;
    let m = Math.floor((e-s)/2+ s);
    mergeSort(s,m);
    mergeSort(m+1,e);
    merge(s,e);

}

const merge = (s: number, e: number) =>{
    
    let m = Math.floor((e-s)/2+ s);
    let j = m+1;
    let tempArr =[];
    while ( s <= m && j <= e ){
        if (xArr[s] < xArr[j]){
            tempArr.push(xArr[s]);
            s++;
        }else{
            tempArr.push(xArr[j]);
            j++;
        }
    }

    //copy the remaining values
    while(s<= m){
        tempArr.push(xArr[s]);
        s++;
    }

    while(j <=e ){
        tempArr.push(xArr[j]);
        j++;
    }

    let z =0;
    //copy back the values from the original array
    for(let k=s; k <=e; k++){
        xArr[k] = tempArr[z];
        z++;
    }

}

 console.log('before Sort', xArr);
 mergeSort(0, xArr.length-1);
 console.log('after Sort',xArr);


}




mergeSortWrapper( );