i am writing a scala function using for-comprehension to find prime numbers till n

Asked May 01 '20 at 07:18

Active May 01 '20 at 08:09

Viewed 279 times

strong text//I am writing a scala function using for-comprehension, primes : Int -> List[Int] that takes a number n and returns a list of prime numbers between 2 and n. Using of for-comprehension is mandatory.

 def primes(n:Int) = 
   for (i <- 2 to n if n > 1) yield
   if (check(i)) println(i) 

  def check(a: Int): Boolean = {
 for (i <- 2 to a) {
    if (a % i != 0) true

 }}
//Example: primes(10) should give List(2,3,5,7)

edited May 01 '20 at 08:09

asked May 01 '20 at 07:18

Daniel

Check it here https://www.scala-lang.org/old/node/230.html – Eklavya May 01 '20 at 07:25
the function should be of the type primes: Int -> List[Int] and use for comprehension – Daniel May 01 '20 at 08:14

i am writing a scala function using for-comprehension to find prime numbers till n

0 Answers0