The goal today is to write a function that determines whether a number is prime.
Write an isPrime function that takes a number as parameter and returns true if this number is prime, false if it isn't.
Reminder: A prime number:
Take a look at the Sieve of Eratosthenes. How much faster did your implementation of the sieve run? How can you account for this in terms of time complexity?
How about non-deterministic approaches?