The word length errors using truncation of sign magnitude code are analyzed.
对原码截断算法的字长误差进行了理论分析；
Thus, for a typical program invocation with N options, the code needs only O(N) [N*O(1)] comparisons—an order of magnitude improvement over the legacy code.
因此，对于具有 N 个选项的典型程序调用，代码只需执行 O(N) [N*O(1)] 比较 — 这是对遗留代码的巨大改进。
In the past, an equivalent implementation to perform a database lookup would have required a couple orders of magnitude more code.
在过去，实现相同的数据库查询操作至少需要两倍于此数量级的代码。
应用推荐