input: Write a function to find prime numbers up to a given integer `n` using the Sieve of Eratosthenes algorithm, which is more efficient than the brute-force approach. The function should print out all prime numbers less than or equal to `n`.
  
  assert sieve_primes(10)==[2, 3, 5, 7]
  assert sieve_primes(5)==[2, 3, 5]
  assert sieve_primes(1)==[]
  assert sieve_primes(0)==[]
  assert sieve_primes(2)==[2]
output: def sieve_primes(n):
      if n < 2:
          return []
      is_prime = [True] * (n + 1)
      p = 2
      while (p * p <= n):
          if (is_prime[p] == True):
              for i in range(p * p, n + 1, p):
                  is_prime[i] = False
          p += 1
      prime_numbers = [p for p in range(2, n + 1) if is_prime[p]]
      return prime_numbers