English 中文(简体)
为什么使用很少和多端的人?
原标题:Why are both little- and big-endian in use?

为什么在二元计算机科学40年之后仍然使用-today? 是否有算法或储存格式能更好地与一种或另一种方式相得益? 如果我们大家转向一个并坚持一个目标,这是否更好?

最佳回答

When adding two numbers (on paper or in a machine), you start with the least significant digits and work towards the most significant digits. (Same goes for many other operations).

在英特尔8088号卫星上,有16个轨道登记册,但有8个轨道数据公共汽车,很少有人允许这种指示在第一个记忆周期之后开始运作。 (当然,为了减少秩序,而不是增加一字的记忆,应当有可能做到,但我怀疑这样做会使设计复杂化。)

在大多数加工商中,公共汽车的宽度与登记相匹配,因此不再带来好处。

另一方面,从多边会计准则开始,可以比较大端的数字(尽管许多比较指示实际上做了需要从LSB开始的分界线)。 信号轨道也非常容易获得。

Are there algorithms or storage formats that work better with one and much worse with the other?

页: 1 这里和那里有小的优势,但没有任何重大优势。

I actually think litte-endian is more natural and consistent: the significance of a bit is 2 ^ (bit_pos + 8 * byte_pos). Whereas with with big endian the significance of a bit is 2 ^ (bit_pos + 8 * (word_size - byte_pos - 1)).

如果我们大家转向一个并坚持一个目标,这是否更好?

由于X86的主导地位,我们无限期地gra为无端者。 在许多移动装置中的ARM芯片具有可喜的终端性,但往往使LE更符合x86世界。 我的罚款。

问题回答

小端人更容易进行播种。 例如,如果你有16个轨道号码,那么你可以简单地把同样的记忆地址作为8个轨道号码的点子处理,因为它含有8个最低点。 因此,你不需要知道你正在处理的确切数据类型(尽管在大多数情况下,你确实知道有任何进展)。

Big Endian是一个比人更容易阅读的比喻。 相对照像任何人类使用的数字系统一样,储存在按逻辑顺序排列的记忆中(最重大的价值首先)。

In times of many, many abstraction layers these arguments don t really count anymore though. I think the main reason we still have both is that nobody wants to switch. There is no obvious reason for either system, so why change anything if your old system works perfectly well?

无论大小终端都具有优势和劣势。 即便是表面上的人(情况并非如此),任何遗产结构都无法改变最终状态,因此,我恐怕你会再次学习。





相关问题
What are the differences between NP, NP-Complete and NP-Hard?

What are the differences between NP, NP-Complete and NP-Hard? I am aware of many resources all over the web. I d like to read your explanations, and the reason is they might be different from what s ...

Implementation Detail for Graph Analysis Algorithms

Let s say I have a graph with "heavy" nodes, that is each node is an object that is already carrying a lot of data. I want to do a graph transformation that requires me to calculate a special ...

Worst case running time (Big O)

I have this question, and I don t know how to solve it, because I don t understand it. :( The question is: Programs A and B are analyzed and are found to have worst case running times no ...

RSA cryptosystem

Hi i am trying to set up an RSA cryptosystem i have all the values except d selected prime numbers: p=1889, q=2003, n=3783667, phi=3779776, e= 61 i got stuck finding d could anyone help me to figure ...

BNF Grammar Derivation

I want to apply rules of BNF Grammar to produce derivation for : a_Num

热门标签