计算机程序设计艺术 第3卷的头一次修订对经典计算机排序和查找技术做了最全面的考察。
它扩充了第1卷对数据结构的处理，以将大小数据库和内外存储器一并考虑；遴选了精心核验的计算机方法，并对其效率做了定量分析。
第3卷的突出特点是对“最优排序”一节的修订和对排列论与通用散列法的讨论。
更多推荐
The first revision of Volume 3 provides the most comprehensive examination of classical computer sorting and search techniques.
It expands Volume 1's treatment of data structures to consider both large and small databases and internal and external memory; carefully verified computer methods are selected and their efficiency quantified.
The standout features of Volume 3 are revisions to the section "Optimal Sorting" and a discussion of permutation theory and universal hashing.
The first revision of Volume 3 provides the most comprehensive examination of classical computer sorting and search techniques.
It expands Volume 1's treatment of data structures to consider both large and
small databases and internal and external memory; carefully verified computer methods are selected and their efficiency quantified.
The standout features of Volume 3 are revisions to the section "Optimal Sorting" and a discussion of permutation theory and universal hashing.
The first revision of Volume 3 provides the most comprehensive examination of classical
computer sorting and search techniques.
It expands Volume 1's treatment of data structures to consider both large
and small databases and internal and external memory; carefully verified computer methods are selected and their efficiency quantified.
The standout features of Volume 3 are revisions to the section "Optimal Sorting" and a discussion of permutation theory and universal hashing.
The first revision of Volume 3 provides the most comprehensive examination of classical computer sorting and search techniques.
The standout features of Volume 3 are revisions to the section "Optimal Sorting" and a discussion of permutation theory and universal hashing.
原创文章受到原创版权保护。转载请注明出处：https://www.ccppcoding.com/archives/1124
非原创文章文中已经注明原地址，如有侵权，联系删除
关注公众号【高性能架构探索】，第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处！
