package com.propollys.levelup;

class MergeArrays{

    int[] doStuff(int[] arr1, int[] arr2){
        int[] resultArray = new int[arr1.length + arr2.length];

        int i = 0, idx1 = 0, idx2 = 0;
        for (;idx1 < arr1.length && idx2 < arr2.length  ; i++) {
            resultArray[i] =  arr1[idx1] < arr2[idx2] ? arr1[idx1++] : arr2[idx2++];
        }
        for (;idx1 < arr1.length; i++ ){
            resultArray[i] = arr1[idx1++];
        }
        for (;idx1 < arr1.length || idx2 < arr2.length; i++ ){
            resultArray[i] = arr2[idx2++];
        }

//        for (; i < arr1.length + arr2.length; i++){
//            if (idx1 == arr1.length){
//                resultArray[i] = arr2[idx2++];
//            }else if (idx2 == arr2.length){
//                resultArray[i] = arr1[idx1++];
//            } else {
//                resultArray[i] =  arr1[idx1] < arr2[idx2] ? arr1[idx1++] : arr2[idx2++];
//            }
//        }
        return resultArray;
    }

    public static void main(String[] args) {
        MergeArrays mergeArrays = new MergeArrays();
        int[] array1 = {1,2,4,4,5,6, 17, 125};
        int[] array2 = {11,12,14,15,16, 17, 125};
        Array.print(mergeArrays.doStuff(array1,array2), array1.length + array2.length);

    }
}