primesAlg

/*
using System;
using System.Collections.Generic;
using System.Threading;
*/

//method

List<int> GetPrimes(int max)
{
    List<int> primes = new List<int>();
    bool isPrime;
    for(int i = 2; i < max; i++)
    {
        isPrime = true;
        for(int j = 2; j < (i ^ (1 / 2)); j++)
        {
            if(i % j == 0)
            {
                isPrime = false;
                break;
            }
        }
        if(isPrime)
        {
            primes.Add(i);
        }
    }
    return primes;
}

//main

List<int> primes = new List<int>();
int max = 50000;
bool isPrime;
Console.WriteLine("Finding prime numbers from 2 to 50.000");
Thread.Sleep(4000);
for(int i = 2; i < max; i++)
{
    isPrime = true;
    for(int j = 2; j < (i^(1/2)); j++)
    {
        if(i % j == 0)
        {
            isPrime = false;
            break;
        }
    }
    if(isPrime)
    {
        Console.WriteLine("number "+i+" IS PRIME! @primes["+primes.Count+"]");
        primes.Add(i);
    }
    else
    {
        Console.WriteLine("number "+i+" ISN'T PRIME.");
    }
}
for(int i = 0; i < primes.Count; i++)
{
    Console.WriteLine("primes["+i+"] = "+primes[i]);
}
Console.WriteLine("\nSearched numbers: "+(max-2));
Console.WriteLine("Primes found: "+primes.Count);