Timeline for Find the Smallest Data Type for a Number
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 28 at 5:33 | comment | added | Ezlanding |
So you're checking for the exit condition floor(n / 2**x) == 0 , where x is the amount of bits you're checking for in each pass (8, 16, 32, 64), then returning 2**depth. Cool solution!
|
|
| Nov 27 at 15:44 | history | edited | Arnauld | CC BY-SA 4.0 |
updated according to the spec clarification
|
| Nov 27 at 15:32 | history | answered | Arnauld | CC BY-SA 4.0 |