scala素数选择

/**
  * Created by fhqplzj on 16-7-15 at 下午10:40.
  */
object Pro {
  def sieve(list: List[Int]): List[Int] = list match {
    case Nil => Nil
    case x :: xs => List(x) ::: sieve(xs.filter(_ % x != 0))
  }

  def prime(n: Int) = {
    val list = (2 to n).toList
    sieve(list)
  }

  def main(args: Array[String]): Unit = {
    /**
      * 计算2到1000之间的素数
      */
    val n = 1000
    val nums = prime(1000)
    println(nums.mkString("(", ",", ")"))
    println(nums.size)
  }
}