insertion sort

InsertionSortTest.kt

package ru.maksim.sample

import org.junit.jupiter.api.Test

class SampleKotlinTest {

    @Test
    fun foo() {
        val arr = intArrayOf(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
        insertionSort(arr)
        println(arr.contentToString())
    }

    @Test
    fun foo_2() {
        val arr = intArrayOf(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
        arr.shuffle()
        insertionSort(arr)
        println(arr.contentToString())
    }

    private fun insertionSort(arr: IntArray) {

        for (i in 1..arr.lastIndex) {

            val key = arr[i]
            var j = i - 1
            while (j >= 0 && arr[j] > key) {
                arr[j + 1] = arr[j]
                j--
            }
            arr[j + 1] = key
        }
    }
}