Timeline for Efficient prime factorization for large numbers
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 14, 2014 at 16:33 | comment | added | chbaker0 | It looks like you are doing trial division. Have you looked at more efficient algorithms? | |
| Oct 14, 2014 at 14:59 | answer | added | DanaJ | timeline score: 3 | |
| Oct 14, 2014 at 14:29 | answer | added | Morwenn | timeline score: 5 | |
| Oct 14, 2014 at 9:46 | answer | added | CashCow | timeline score: 2 | |
| Oct 14, 2014 at 8:18 | answer | added | Heslacher | timeline score: 3 | |
| Oct 13, 2014 at 16:08 | comment | added | booky99 | wow yeah haha that shaved off about 3 seconds off of the program. Thanks! | |
| Oct 13, 2014 at 16:07 | comment | added | Heslacher | A simple improvement would be to change your for (int i = 2; i <= sqrt_of_n; i++) loop to for (int i = 3; i <= sqrt_of_n; i = i +2) | |
| Oct 13, 2014 at 16:06 | history | edited | Jamal | CC BY-SA 3.0 | deleted 25 characters in body; edited tags; edited title |
| Oct 13, 2014 at 16:03 | review | First posts | |||
| Oct 13, 2014 at 16:08 | |||||
| Oct 13, 2014 at 16:00 | history | asked | booky99 | CC BY-SA 3.0 |