import scala.math.sqrt
import scala.util.control.Breaks._
def isPrime(n: Int): Boolean = {
if (n == 0) return false
if (n == 1) return false
var result: Boolean = true
breakable {
for (i <- 2 to sqrt(n).toInt) {
if (n % i == 0) {
result = false
break
}
}
}
return result
}
val arr = Array(4, 8, 17, 5, 9, 22, 21, 13, 18, 99)
var max = arr(0)
for (i <- arr.indices) {
if (isPrime(arr(i)) == true) { // 17 5 13
if (max < arr(i)) {
max = arr(i)
}
}
}
println(max)
/*
run:
17
*/