insertion sort using Kotlin

insertionSort.kt

package com.example

fun insertionSort(array: IntArray) {
    for ((index, value) in array.withIndex()) {
//        println("the element at $index is $value")
        var j = index

        while (j > 0 ) {
            // swap if smaller than sorted[j]
            if (array[j] < array[j - 1]) {
                val temp = array[j]
                array[j] = array[j - 1]
                array[j - 1] = temp

            }
            j--
        }

    }

}

fun main(args: Array<String>) {
    val array  = intArrayOf(4, 3, 5, 6, 2, 1)
    array.forEach { i -> println(i) }
    insertionSort(array)
    array.forEach { i -> println(i) }
}