The outer loop on the Wikipedia page for the Sieve of Eratosthenes ends at √n:
for i = 2, 3, 4, ..., √n :
Is this because if n has a square root it wont be prime? From what I understand this implies that any numbers above √n will also not be prime.
Why does the loop break at √n?