I read a bit about it, and my understanding is not that bytes get rearranged from say lowest value to highest value, but from least significant to most significant. In this case, that would mean that the most significant byte is the one at the beginning of an offset, and that would go in the biggest address, making it essentially a reverse of the the offset. That is my understanding of it from this page, and the examples it shows.
I am by no means an expert, and I could certainly be wrong and have misunderstood how pointers are written, but I have been hacking Fire Red for a while, and hex editing, and have never come up with a problem before doing it my way.
Ah, I got confused then. I'm use to working with multiple values in tables and listing them all next to eachother. For example, I would have 71 3C and B3 A2. In little endian, these two shorts next to eachother would be 3C 71 A2 B3. Being used to this, I just associated incremental order with little endian. My mistake! I'll delete my previous posts regarding it :p
Last edited: