资源列表
tree
- 二叉树的实现，简单实现增删改查功能，基本的数据结构-The realization of a binary tree, simple CRUD functions, the basic data structure
danlianbiao
- 单链表的建立(头插法),插入,删除,查找、修改、计数、输出-The establishment of a singly linked list (first interpolation), insert, delete, find, modify, count, output
pailiezuhe
- 实现了字典序求全排列的算法和组合算法． 用C++实现排列组合算法(排列仅实现字典序法,程序见附件)
ForHuffmancoding
- 用c写的一个 求赫夫曼编码 程序 出自严蔚敏写的数据结构-With c write a program for Huffman coding
last
- C语言版的最小生成树问题，比较简单，问题比较多，错误比较多-C language version of the minimum spanning tree problem is relatively simple, more problems, more wrong. . .
3
- 数据结构书中 的最短路径 c++源代码 可以参考一下-by c++
ReverseLinkedListEveryKNodes
- 链表中每K个节点 逆置。..导入eclipse时要改包名package classOne -Reverse LinkedList Every K Nodes change package name,
ycomb
- Y-combinator 解决fibonacci数列的一个实现，实现了不定义函数名称而实现递归的过程-Y-combinator solve a fibonacci series to achieve, the realization of the non-defined function name to achieve the process of recursive
skiplist.c.tar
- A skip list is a data structure for storing a sorted list of items, using a hierarchy of linked lists that connect increasingly sparse subsequences of the items. These auxiliary lists allow item lookup with efficiency comparable to balanced binary se
huffman-coding
- 该程序是实现输入一串字符后对其进行哈夫曼编码输出-huffman coding
greedy
- 贪心法解决背包问题 可自己设置物品数量和背包总容量-Greedy method to solve the knapsack problem and the number of items can set up their own backpack with a total capacity
sanjiaopaofen
- 北邮大二算法设计与分析 关于三角剖分启发式的算法实现-BUPT sophomore algorithm design and analysis heuristic algorithm implementation on triangulation