Merge Sort in Kotlin

Welcome to the Merge Sort in Kotlin page! Here, you'll find the source code for this program as well as a description of how the program works.

Current Solution

fun main(args: Array<String>) 
{
    var arr: IntArray
    try
    {
        arr = args[0].split(", ").map{ it.toInt() }.toIntArray()
        if (arr.size < 2) {
            throw Exception()
        }
    }
    catch(e: Exception)
    {
        println("Usage: please provide a list of at least two integers to sort in the format \"1, 2, 3, 4, 5\"")
        return
    }

    var ans:IntArray = mergeSort(arr)
    for(i in 0 until ans.count())
    {
        if (i==ans.count()-1)
        {
            println("${ans[i]}")
            return
        }
        print("${ans[i]}, ")
    }
}

fun mergeSort(arr1: IntArray):IntArray
{
    var arr:IntArray = arr1
    if (arr.count() > 1)
    {
        var mid:Int = (arr.count() - 1) / 2
        var left = arr.sliceArray(0..mid)
        var right = arr.sliceArray(mid + 1..arr.count() - 1)
        
        left = mergeSort(left)
        right = mergeSort(right)

        arr = intArrayOf()
        while (left.count() > 0 && right.count() > 0)
        {
            if (left[0] < right[0])
            {
                arr = arr + left.sliceArray(0..0)
                left = left.sliceArray(1..left.count() - 1) 
            }
            else
            { 
                arr = arr + right.sliceArray(0..0)
                right = right.sliceArray(1..right.count() - 1)
            } 
        }
        arr = arr + left + right
    }
    return(arr)
}

Merge Sort in Kotlin was written by:

• Blake.Ke
• Jeremy Grifski
• mikenmo

If you see anything you'd like to change or update, please consider contributing.

How to Implement the Solution

No 'How to Implement the Solution' section available. Please consider contributing.

How to Run the Solution

No 'How to Run the Solution' section available. Please consider contributing.