C# - Program to find all primes upto a given number (Seive of Eratosthenes)

Seive of Eratosthenes.cs

using System;
class Program
    {
        public static void Main(string[] args)
        {

            Console.WriteLine("Enter the number upto which you want to list primes");
            int n = Convert.ToInt32(Console.ReadLine());

            bool[] prime = new bool[n + 1]; // default value is false for boolean
            for (int i = 2; i <= n; i++) prime[i] = true;

            int limit = (int)Math.Ceiling(Math.Sqrt(n));

            for (int i = 2; i <= limit; i++)
                if (prime[i])
                    for (int j = i * i; j <= n; j += i)
                        prime[j] = false;

            Console.WriteLine("Prime Numbers upto {0}", n);

            for (int i = 0; i <= n; i++)
                if (prime[i])
                    Console.WriteLine(i);
        }

    }