Timeline for Performance of modular square root
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 28, 2014 at 6:31 | history | edited | Jamal | CC BY-SA 3.0 |
added 16 characters in body
|
| Jan 12, 2014 at 20:37 | comment | added | ruds | Yikes, I hadn't considered that. I still think that putting 100s of MBs into RAM and doing random access is going to be pretty slow; I suppose it depends on python's malloc implementation. | |
| Jan 12, 2014 at 18:29 | comment | added | Janne Karila |
In Python, x*x returns a reference to a new integer object and allocates it on the heap, while squ[x] returns a reference to an existing object. The latter can indeed be a little faster.
|
|
| Jan 12, 2014 at 18:12 | comment | added | Michal | Basically calculating so faster then reading from disk, so I overdoing it? Also good tip with the beginning from square root, would up vote but not enough rep :( | |
| Jan 11, 2014 at 19:39 | history | answered | ruds | CC BY-SA 3.0 |