Binary digits: Difference between revisions
Content added Content deleted
| Line 1,563: | Line 1,563: | ||
// |
// |
||
// A faster algorithm would be conversion octets to strings by a lookup table. |
// A faster algorithm would be conversion octets to strings by a lookup table. |
||
// There is only 2**8 == 256 octets, therefore we would need only |
// There is only 2**8 == 256 octets, therefore we would need only 4096 bytes |
||
// for the lookup table. Conversion of a 64-bit integers would need 8 lookups |
// for the lookup table. Conversion of a 64-bit integers would need 8 lookups |
||
// instead 64 and/or/shifts of bits etc. Even more... lookups may be implemented |
// instead 64 and/or/shifts of bits etc. Even more... lookups may be implemented |
||