Return all prime numbers smaller than M

Question

Given an integer M. return all prime numbers smaller than M.

Give a algorithm as good as you can. Need to consider time and space complexity.

Answer 1

Sieve of Eratosthenes is good.