Re^5: Understanding endianness of a number

PDP-11 was very common in its time, and used the 'BADC' byte order.

I thought wikipedia would have that tidbit, but apparently not. [softwareengineering.stackexchange.com/questions/215535|This]^#1 seems to have a good answer. Anyway, one benefit of the little-endian architecture is that it can help you with pointer addressing. One may cast an int pointer to unsigned char pointer, and use that to inspect the "character value" of a small int. Zero offset ie no index uses the simpler addressing mode and may yield more compact machine code.

Little-endian is conceptually similar to positional number system, where the number base is exponentiated by index. Index 0 for the smallest digit and so on. (In big-endian, the offset is offset by the operand width. Buffalo buffalo buffalo;)

#1. Linking to stackexchange is prohibited?

Comment on Re^5: Understanding endianness of a number

Replies are listed 'Best First'.
Re^6: Understanding endianness of a number by choroba (Cardinal) on Jul 27, 2017 at 17:56 UTC
> Linking to stackexchange is prohibited? No, you just need to specify the full address, i.e. include the https?:// at the beginning. ($q=q:Sq=~/;[c](.)(.)/;chr(-\|\|-\|5+lengthSq)`"S\|oS2"`map{chr \|+ord }map{substrSq`S_+\|`\|}3E\|-\|`7**2-3:)=~y+S\|`+$1,++print+eval$q,q,a, [download]	[reply] [d/l]
Re^7: Understanding endianness of a number by Anonymous Monk on Jul 27, 2017 at 19:32 UTC
When I do that, I get permission denied. (Not on preview but on sumbit.)	[reply]
Re^8: Understanding endianness of a number by Corion (Patriarch) on Jul 27, 2017 at 19:47 UTC
`stackexchange.com` was not allowed as a link for Anonymous Monk. I've now allowed it, so you should be able to post links to it from now on.	[reply]