资源列表
mergeinS
- merge sort give a set S of n integers and another integer x, determine whether or not there exits two elements in S whose sum is exactly x.-merge sort give a set of S n integers and anot her integer x, determine whether or not there exits two elemen
table
- 这是一个简单的表格二维表格，但不能直接在表格里面添加或删除数据。-This is a simple form two-dimensional form, but not directly inside the table to add or delete data.
shuju
- 单链表的交集，并集，插集，逆置，定位的实现-Single list of the intersection, and set, insert set, reverse home, location of implementation
fyzd
- 回溯法计算总费用最小费用，回溯法计算总费用最小费用-回溯法计算总费用最小费用
3-3
- 链式存储一些有序的数据，插入新数据后使链表保持有序，数据结构课程的实例-Chain store some data in order to insert new data to maintain the order list, an instance of the data structure course
ccc
- 数据结构中有关栈的应用，可运行可执行无错误，希望对大家有帮助-Stack data structure in relation to the application executable can run without error, we want to help
advanced-pop-sort-
- 改进过的冒泡排序算法，比传统的冒泡排序高效，实现很简单-Improvement over the bubble sort algorithm, and efficient than the traditional bubble sort to achieve is very simple
chengshi
- 一个天平，砝码分别为1g、3g、9g、27g、6561g，每个砝码只有一个，要称重的物品放在天平的左侧，而砝码允许放在天平的左右两侧。已知一个物品的重量，问如何称重？试编程解决。-A balance, weights were 1g, 3g, 9g, 27g, 6561g, each weight is only one item on the scale to weigh the left, while the weight allowed on both sides of the bala
Unidirectional-ring-table-Josephus
- 单向环表实现约瑟夫环，cout<<"请输入整数m,s,n:"<<endl cout<<"输出序列为： " -Unidirectional ring table Josephus
bitree
- 二叉树的运用和介绍，虽然结构简单，但在类似淘宝网等网站开发中应用广泛-The the the use of and presentation of of of the binary tree, Although the the structure is simple, but wide range of applications with the in the similar Taobao, and other web site development
huisu
- 0-1背包问题的回溯算法，算法分析与设计-0-1 knapsack problem backtracking algorithm, algorithm analysis and design
huffman
- 由于目前数字通信中一般都使用二进制符号，因此二进制的Huffman编码技术最为普遍，其编码步骤如下： 1、将信源符号按概率从大到小进行排列； 2、给两个概率最小的信源符号各分配一个码元“0”和“1”，然后将这两个信源符号合并成一个新符号，并用这两个最小的概率之和作为新符号的概率，结果得到一个只有（n-1）个信源符号的新信源（假设原来所需编码的符号数为n），称为信源的第一次缩减信源S1； 3、将缩减信源S1的符号仍按概率从大到小的顺序进行排列，重复步骤2，得到只含（n-2）个符号的缩减