Timeline for Computing integer square roots in Java - follow-up
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 26, 2016 at 18:43 | comment | added | coderodde |
I think we proved that P = NP. Money, here we go!
|
|
| Jan 19, 2016 at 16:47 | comment | added | oliverpool |
Since the input is bounded, all algorithms are actually O(1) (it might just not be trivial to find the bound)
|
|
| Jan 19, 2016 at 16:46 | comment | added | oliverpool | @SimonForsberg that's right, I updated my answer accordingly | |
| Jan 19, 2016 at 16:45 | history | edited | oliverpool | CC BY-SA 3.0 |
added 190 characters in body
|
| Jan 19, 2016 at 15:51 | comment | added | Simon Forsberg |
I'd rather say that this will be O(log(sqrt(CONSTANT)), the complexity does not scale according to the input in this case. Technically, because sqrt(CONSTANT) is also a constant, and log(constant) is also a constant, you could even call this O(1).
|
|
| Jan 19, 2016 at 15:41 | history | answered | oliverpool | CC BY-SA 3.0 |