sieve of eratosthenes kotlin code

sieveeratosthenes.kt

fun getPrime(n:Int){
    val numArray = BooleanArray(n) {_ -> true}
    var i = 2
    while(i * i < n) {
        //for each prime number less than square root of n :
        if (numArray[i]) {
            var j = i
            while (j * i < n) {
                //mark the multiples of that prime number as false . do this below n
                numArray[j * i] = false
                j++
            }

            i++
        }
    }
    numArray.forEachIndexed { index, b ->
        println(index)
        println(b)

    }
}
fun main() {
getPrime(16) // get prime numbers from 1 to 15 inclusive
}