-
hafumanTree
数据结构课程设计,在VC环境下完成,利用哈夫曼树原理,主要功能是实现字符的压缩和解压缩,设计脉络清晰,易懂(Data structure course design, completed in the VC environment, using Huffman tree principle, the main function is to achieve the character of the compression and decompression, design, clear structure, easy to understand)
- 2011-01-02 13:15:23下载
- 积分:1
-
9
说明: 任意给定输入的一个小写英文字符串a1a2a3…an-1an (n≥5)
输出:字符串Ana1An-1a2An-2a3…A2an-1A1an,其中Ai为ai的大写形式
例如,输入aybdx,则递归程序输出XaDyBbYdAx
(Any given input of a lowercase string a1a2a3 ... an-1an (n ≥ 5) Output: the string Ana1An-1a2An-2a3 A2an-1A1an, which Ai ai uppercase for example, input aybdx recursive program output XaDyBbYdAx)
- 2012-05-30 10:59:39下载
- 积分:1
-
banker
用银行家算法实现资源分配,Bankers algorithm to achieve the allocation of resources(Bankers algorithm to achieve the allocation of resources)
- 2012-03-13 13:20:43下载
- 积分:1
-
The-sum-of-Multinomial
数据结构中的一元多项式相加,多于考研算法实现很重要。后续部分将在后期上传!(The sum of Multinomial)
- 2011-05-09 15:47:30下载
- 积分:1
-
order
通过冒泡排序法和选择排序法实现对若干数字的排序。(To achieve the order of several numbers)
- 2014-06-08 18:35:10下载
- 积分:1
-
sort-algorithm-validation
直接插入排序算法验证。
快速排序算法验证。
直接选择排序算法验证。
(Direct insertion sort algorithm validation. Quick sort algorithm validation. Direct selection sort algorithm validation.)
- 2013-04-22 19:18:54下载
- 积分:1
-
heapsort
说明: 从最后一个非叶子结点开始从后往前进行调整,保证了根下的所有子树都是最大堆,最后对根进行调整,使整棵二叉树为最大堆,保证了根结点为整棵数的最大值点,完成了建堆的过程,再将根结点跟最后一个结点进行交换,如此反复操作,则堆排序就完成了,其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
- 2008-11-11 22:53:42下载
- 积分:1
-
point
用分治算法(O(nlogn)复杂度)实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))
- 2012-12-16 13:14:04下载
- 积分:1
-
Dijkstra
主要是DIJKSTRA经典算法,可以作为单个算法来读,也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)
- 2010-09-25 17:37:40下载
- 积分:1
-
NoGo
计算机博弈大赛不围棋的代码 个人所写,可以用来参考( U8BA1 u7B97 u673A u535A u5F08 u5927 u8D5B u4E0D u56F4 u68CB u7684 u4EE3 u7801 u4E2A u4EBA u6240 u5199 uFF0C u53EF u4EE5 u7528 u6765 u53C2 u8003)
- 2021-04-04 19:39:04下载
- 积分:1