Skip to content

Instantly share code, notes, and snippets.

@CodyEngel
Last active August 29, 2015 14:16
Show Gist options
  • Save CodyEngel/0d2e8e2dc2a47bdf6a8a to your computer and use it in GitHub Desktop.
Save CodyEngel/0d2e8e2dc2a47bdf6a8a to your computer and use it in GitHub Desktop.
Generate Primes - Brute Force
public static List<int> returnPrimeNumbersToN(int n)
{
List<int> primeNumbers = new List<int>();
// populate list
for (int i = 2; i <= n; i++)
{
primeNumbers.Add(i);
}
// remove non-prime numbers
int size = primeNumbers.Count;
for (int i = 0; i < size; i++)
{
for (int j = i + 1; j < size; j++)
{
if (primeNumbers[j] % primeNumbers[i] == 0)
{
primeNumbers.RemoveAt(j);
size = primeNumbers.Count;
}
}
}
return primeNumbers;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment