Endianess

Forif

如何利用端序来实现某些情况下编码的高效性（字符串）？

Forif

稍微顶一下 很想知道原因…

zyrlau

我是初级：
    我所能体会的是在网络通信中，用可以改变endian的处理器去适应不能改变endian的处理器，这样可以不用转换网络字节顺序

Forif

原问题是这样的
This question pertains to endianness.Let's say you want to write a program for comparing two strings.You have a choice of using a 32-bit byte-addressable big-endian or little-endian architecture to do this.In either case,you can pack four characters into each word of 32 bits.Which one would you choose and how will you write such a program?[Hint:Normally,you would do string comparison,one character at a time.If you can do it a word at a time instead of a character at a time,that implementation will be faster.]
我的想法是用一个int型指针指向字符串数组不就可以利用整型数组来一次比较四个字符了吗？和端序又有什么联系？
我是一个上学的学生，了解不是很深，考虑难免不成熟，还请大家帮帮忙

Forif

再顶最后一次 再沉下去我就认了