Timeline for Prime numbers less than a given number N
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 12, 2015 at 16:41 | comment | added | RBarryYoung |
I'm pretty sure that if all you care about is the number of primes below N, it can be done in O(Sqrt(N) log(Sqrt(N)).
|
|
| Jan 12, 2015 at 11:36 | comment | added | Veedrac | To get \$\mathcal{O}(n \log n)\$ time, you'll need to use a sieve. | |
| Jan 12, 2015 at 10:56 | answer | added | 200_success | timeline score: 5 | |
| Jan 12, 2015 at 10:48 | history | edited | 200_success | CC BY-SA 3.0 |
summarized problem
|
| Jan 12, 2015 at 8:33 | vote | accept | Rodolfo Dias | ||
| Jan 12, 2015 at 8:20 | answer | added | Heslacher | timeline score: 8 | |
| Jan 12, 2015 at 8:06 | history | edited | Heslacher | CC BY-SA 3.0 |
deleted 26 characters in body; edited title
|
| Jan 12, 2015 at 7:56 | review | First posts | |||
| Jan 12, 2015 at 8:06 | |||||
| Jan 12, 2015 at 7:53 | history | asked | Rodolfo Dias | CC BY-SA 3.0 |