Timeline for Find the number of leading zeroes in a 64-bit integer
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 11, 2018 at 12:04 | comment | added | Arnauld | @Neil Unreadable code on PPCG?? This can't be! Fixed! :p | |
| Dec 11, 2018 at 12:01 | history | edited | Arnauld | CC BY-SA 4.0 |
cosmetic update
|
| Dec 11, 2018 at 9:25 | comment | added | Neil | The fact that the BigInt suffix is the same character as your parameter is very confusing... | |
| Dec 10, 2018 at 13:48 | comment | added | Arnauld |
@IsmaelMiguel No worries. :) It's indeed possible to have the .toString() approach working, but we still need a BigInt literal as input. Otherwise, we only have 52 bits of mantissa, leading to invalid results when precision is lost.
|
|
| Dec 10, 2018 at 13:41 | comment | added | Ismael Miguel | You're right. Thank you :( I though I found an alternative for you :/ | |
| Dec 10, 2018 at 13:28 | comment | added | Arnauld |
@IsmaelMiguel I suppose you meant n=>n<1?0:n.toString(2).length-64, but that would not work anyway. This would, I think.
|
|
| Dec 10, 2018 at 12:59 | comment | added | Ismael Miguel |
Wouldn't n=>n<1?0:n.toString(2)-64 perform the same?
|
|
| Dec 9, 2018 at 23:45 | history | edited | Arnauld | CC BY-SA 4.0 |
added a link to a shorter version
|
| Dec 9, 2018 at 23:19 | history | answered | Arnauld | CC BY-SA 4.0 |