-
12
说明: 哈希表,用c++语言编写,可操作运行,结果正确(Hash table, using c++ language, operational run, the results are correct)
- 2011-05-06 14:42:14下载
- 积分:1
-
sk_buff
sk_buff结构体,网络数据包传送,在内核中sk_buff表示一个网络数据包,它是一个双向链表,而链表头就是sk_buff_head,(sk_buff structure, network packet transmission, the kernel sk_buff represents a network packet, which is a doubly linked list, and the list head is sk_buff_head,)
- 2013-11-23 22:28:20下载
- 积分:1
-
Bitree
二叉树的打包数据结构,包括遍历,删除,添加,注释详细(Packaged binary tree data structure, including traversal, delete, add, annotate details)
- 2015-10-04 23:44:33下载
- 积分:1
-
8_queen
8_queen问题的一个自创的算法,还不错!(8_queen)
- 2009-10-21 11:49:24下载
- 积分:1
-
fml
已知二叉树的先序遍历结果,建立二叉树并输出其先序、中序、后序遍历结果(Build a binary tree and print the results of preorder, midorder and postorder traversals based on the known result of preorder traversal)
- 2015-02-15 15:20:26下载
- 积分:1
-
Huffman
数据结构,利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
- 2014-01-28 18:25:24下载
- 积分:1
-
beibao_9
背包问题,经典的9个算法详细解析。每一个都有详细的讲解和代码分析。。(Knapsack problem, the classic algorithm detailed analysis of nine. Each with a detailed explanation and code analysis. .)
- 2011-10-24 18:43:27下载
- 积分:1
-
1013_digital_root
数字根算法,用最简单的代码计算数字根。如果把一个大数的各位数字相加得到一个和,再把这个和的各位数字相加又得一个和,再继续作数字和,直到最后的数字和是个位数为止,这最后的数称为最初那个数的“数字根”。(Digital root algorithm, with the most simple code to calculate the digital root. If you figure in a large numbers is the sum of a, then this and you figure the sum is again a, and then continue for digital and until the final figure and the single digits, the last number called initially that the number of "digital root".)
- 2012-04-27 10:07:18下载
- 积分:1
-
fast_sort
/*快速排序:以待排序元素中的第一个元素作为基准将带排序的元素分为三组
*大于基准元素为一组置于基准值的右边,小于基准值的元素为一组置于基准值的左边,
*基准值为一组,这样就找到了基准元素的位置就确定了
*如此递归调用。直到每一组的low==high,即实现了排序的要求。
*/
(/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
- 2012-10-26 21:42:43下载
- 积分:1
-
DisplayBTree
代码注重B树插入、删除的算法逻辑,适用于
学习者研究B树实现的核心思想。代码中无庞杂的无关操作(focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation )
- 2006-07-19 00:00:38下载
- 积分:1