Kotlin-Algorithms-and-Design-Patterns/src/main/kotlin/other/SieveOfEratosthenes.kt

package other

/**
 *
 * The sieve of Eratosthenes allows you to efficiently calculate a series of prime numbers
 *
 * algorithm complexity: nlog(logn) operations
 *
 */

class SieveOfEratosthenes {

    /**
     *
     * computes a series of primes for the maximum value
     *
     * @param maxNumber - maximum value
     * @return returns a list of prime numbers
     *
     */
    fun compute(maxNumber: Int) : List<Int> {
        val numbers = Array(maxNumber + 1) { index -> index >= 2 }

        var x = 2
        while (x * x <= maxNumber) {
            if (numbers[x]) {
                for (y in x * x..maxNumber step x) {
                    numbers[y] = false
                }
            }
            x++
        }

        val primes = mutableListOf<Int>()

        numbers.forEachIndexed { number, isPrime ->
            if (isPrime) {
                primes.add(number)
            }
        }

        return primes
    }

}