Question

How to sum all the prime numbers in an array with Kotlin

Answer 1

class SumAllPrimeNumbersInArray  {

    fun isPrime(n: Int): Int {
        if (n == 0 || n == 1) return 0

        for (i in 2..Math.sqrt(n.toDouble()).toInt()) {
            if (n % i == 0) {
                return 0
            }
        }

        return 1
    }

    companion object {
        @JvmStatic
        fun main(args: Array<String>) {
            val SumAllPrime = SumAllPrimeNumbersInArray()
            val arr = arrayOf(9, 8, 17, 5, 19, 22, 21, 13, 38, 500, 99)
            var sumPrime = 0

            for (i in arr.indices) {
                if (SumAllPrime.isPrime(arr[i]) == 1) { // 19 17 5 13
                    sumPrime += arr[i]
                }
            }

            println(sumPrime)
        }
    }
}



/*
run:
  
54
  
*/

 

70+ SQL courses for beginners and professionals