TraversalMerge

    fun alternateMerge(arr1: IntArray, arr2: IntArray,
                       n1: Int, n2: Int, arr3: IntArray) {
        var i = 0
        var j = 0
        var k = 0
        // Traverse both array
        while (i < n1 && j < n2) {
            arr3[k++] = arr1[i++]
            arr3[k++] = arr2[j++]
        }
        // Store remaining elements of first array
        while (i < n1) arr3[k++] = arr1[i++]
        // Store remaining elements of second array
        while (j < n2) arr3[k++] = arr2[j++]
    }