// using for single for loop 

​

let arrrone = [0,3,4,31];

let arrayTwo = [4,6,30,31,33];

let j = 0;

let k = 0;

let mergedArray = [];

​

let length = arrrone.length + arrayTwo.length;

​

console.log(length)

​

for(let i = 0; i<= length - 1; i++){

  if(arrrone[j] < arrayTwo[k]){

    mergedArray.push(arrrone[j]);

    j++;

  }

  else if(arrrone[j] > arrayTwo[k]){

    mergedArray.push(arrayTwo[k]);

    k++;

  }

  else if(arrrone[j] == arrayTwo[k]){

    mergedArray.push(arrrone[j]);

    mergedArray.push(arrayTwo[k]);

    j++;

    k++;

  }

}

​

console.log(mergedArray)

//write javascript code for merge two sorted array

//-------------------

const mergeTwoSortedArray = (arr1, arr2) => {

    let mergedArray = []

    let i = 0, j = 0

​

    while (i < arr1.length || j < arr2.length) {

        if (arr1[i]) {

            mergedArray.push(arr1[i])

            i++

        }

        else if (arr2[j]) {

            mergedArray.push(arr2[j])

            j++

        }

    }

    return mergedArray

};

let x = mergeTwoSortedArray([1, 2, 3, 4, 5], [6, 7, 8, 9]); 

console.log('ok x', x);

let mergedArr = [...arr1, ...arr2];

return mergedArr.sort((a, b) => a-b);

let mergedArray = [...arr1, ...arr2];

return mergedArray.sort((a, b) => a-b);