Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with primes
Search options not deleted
user 45968
Primes or prime numbers are numbers which are divisible only by themselves and one, starting with 2, 3, 5, 7, 11.... They are commonly used in encryption and hashing algorithms.
5
votes
2
answers
2k
views
Prime Number Speed
List<int> Primes = new List<int>();
Primes.Add(2);
int half = count/2 + 1;
bool[] nums = new bool[half];
for (int i = 0;i<half;i++)
{
if (! … nums[i])
{
int number = i * 2 + 3;
Primes.Add(number);
for (int j = i + number; j < half; j += number)
{
nums[j] = true;
}
}
}
return Primes; …
- 151