Timeline for Computing the integer square root of large numbers
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 24, 2017 at 12:05 | comment | added | Martin R |
isqrt is slower than isqrt_simple by a factor of about 3, so the extra work (2 multiplications with overflow check) is relevant. Reducing that factor would be nice.
|
|
| Oct 24, 2017 at 11:57 | comment | added | Łukasz Zwierko | Not saying they are off-topic, just saying you might get better feedback at SO as, like I said, your actual code does not do much work so there's not much to optimize / review here. Now, if you wrote your own sqrt implementation, that might be very nice too look at and comment of performance and stuff. | |
| Oct 24, 2017 at 11:39 | comment | added | Martin R | Performance questions are on-topic (compare help center), and I did not restrict my question to that aspect ("All feedback is welcome ...") | |
| Oct 24, 2017 at 11:32 | history | answered | Łukasz Zwierko | CC BY-SA 3.0 |