资源列表
[数据结构常用算法] Kruse_Chapter_8
说明:本文介绍了数据结构中的选择排序,希尔排序等算法,采用全英文版,真实可靠-This paper introduces the data structure of choice, in order of ranking algorithms such as Hill, was used in English, true and reliable<张里> 在 2025-06-07 上传 | 大小:169kb | 下载:0
[数据结构常用算法] improved mergesort
说明:这是一个改进了自顶向下的归并排序,它改进的地方主要有:采用小子文件截止的机制,当序列长度小于32时,采用直接插入排序;对归并的内循环作了优化,判断的次数更少。-This is an improvement from a top-down sort of merger, it improved the main : the deadline for the paper boy mechanism, the length of the sequence is less than 32, the us<唐海浪> 在 2025-06-07 上传 | 大小:3kb | 下载:0
[数据结构常用算法] distsort
说明:该程序是分布计数排序,它是我所见过的各种排序方法中最快的,它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限,并且如果上限与下限的差值比较大的话,空间消耗也比较大.-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it's time complexity of O (n), but this sort known to be<唐海浪> 在 2025-06-07 上传 | 大小:3kb | 下载:0
[数据结构常用算法] gelei combination
说明:该程序用格雷码来生成组合数序列,它比一般的方法要快,这是由格雷码的分布特性所决定的.-the procedures used to generate Gray code sequence portfolio, it generally means than to be fast, it was a Gray code distribution by the decision.<唐海浪> 在 2025-06-07 上传 | 大小:3kb | 下载:0
[数据结构常用算法] dynamic knapsack
说明:该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparab<唐海浪> 在 2025-06-07 上传 | 大小:3kb | 下载:0