Talk:Binary digits: Difference between revisions
Content added Content deleted
No edit summary |
(Given a decimal value n, produce its binary digits.) |
||
| Line 16: | Line 16: | ||
:::Also a conversion routine that handle several different number bases, may not be the best way to handle a conversion to binary. The routines in [[Non-decimal radices/Convert]] are probably best used in generic circumstances when the target base is not known at compile time. If we know we are going to require binary, then dedicated binary handling methods are best deployed. [[User:Markhobley|Markhobley]] 18:23, 6 July 2011 (UTC) |
:::Also a conversion routine that handle several different number bases, may not be the best way to handle a conversion to binary. The routines in [[Non-decimal radices/Convert]] are probably best used in generic circumstances when the target base is not known at compile time. If we know we are going to require binary, then dedicated binary handling methods are best deployed. [[User:Markhobley|Markhobley]] 18:23, 6 July 2011 (UTC) |
||
::::So exactly what is the goal, take a string of binary digits and produce a native number type? Or the other way around? Your earlier explanation seems to go the opposite direction than the task description. Also hex and oct handling share a lot similarities with binary, only decimal is the odd one. --[[User:Ledrug|Ledrug]] 18:28, 6 July 2011 (UTC) |
::::So exactly what is the goal, take a string of binary digits and produce a native number type? Or the other way around? Your earlier explanation seems to go the opposite direction than the task description. Also hex and oct handling share a lot similarities with binary, only decimal is the odd one. --[[User:Ledrug|Ledrug]] 18:28, 6 July 2011 (UTC) |
||
:::::Given a decimal value n, produce its binary digits. Some languages will need to perform number crunching and string manipulation to achieve this. [[User:Markhobley|Markhobley]] 18:36, 6 July 2011 (UTC) |
|||