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)] 比较 — 这是对遗留代码的巨大改进。
Place the partitions for the table space and indexes on separate DASD volumes and (if possible) separate control units in order to minimize I/O contention.
将用于表空间和索引的分区放在单独的 DASD 卷中,并且,如果可能的话,要隔开控制单元,以减少 I/O 争用。
For example, if the complexity order of the current technique is O(n**2), speeding up the steps by 10x is a lot less helpful than finding an O(n) substitute.
例如,如果当前技术的复杂性等级是 O(n**2),那么将这些步骤加速 10 倍远不及寻找 O(n) 替代品来得有用。
应用推荐