using System;

​

/// Chapter 5. GeneratePrimes refactored

/// <summary>

/// author: Robert C. Martin /// </summary>

public class GeneratePrimes

{

    private static bool[] sieves;   // true if the number is prime

    private static int[] result;

    public static int[] GeneratePrimeNumbers(int maxValue)

    {

        if (maxValue < 2)

            return new int[0];

        else {

            InitializeSieve(maxValue);

            CrossOutMultiples();

            LoadPrimes();

            return result; // return the primes

        }

    }

    private static void InitializeSieve(int maxValue) 

    {

        // TO-DO: initialize array to true. 

​

        // TO-DO: get rid of known non-primes

​

    }

    private static void CrossOutMultiples() 

    {

        for (int i = 2; i < Math.Sqrt(sieves.Length) + 1; i++) 

        {

            // if i is uncrossed, cross its multiples 

​

        }

    }

    private static void LoadPrimes() 

    {

        // track number of primes

        int count = 0;

        // TO_DO: how many primes are there? 

​

        // allocate memory for result

        result = new int[count];

        // To-DO: move the primes into result

​

​

    }

}

​

/// tester                  

public class Program

{

    public static void Main()

    {

        Console.WriteLine("Enter an integer:");

        int maxValue = Convert.ToInt32(Console.ReadLine());

        int[] primes = GeneratePrimes.GeneratePrimeNumbers(maxValue);

        Console.WriteLine("The prime numbers are:");

        for (int i = 0; i < primes.Length; i++)

        {

            Console.WriteLine(primes[i]);

        }

    }

}