资源列表
HuffumanCode.cpp
- 用C语言简单的实现数据结构里面的哈弗曼编码-Data structures inside the Havermann coding
shushuzhuang
- 打印树状二叉树，用队列，按层次打印 按先序遍历和中序遍历建立二叉树-Print the tree binary tree, with a queue, by level of print by the first order traversal and inorder traversal binary tree set up
main
- 完成了简单的A*（A star）算法 可以用于求解第K短路径-Completion of a simple A* (A star) algorithm can be used to solve the first K shortest paths
Binary-search
- 折半查找。具体是对程序中查找功能的修正，使其效率增加。-Binary search. Is a program to find the specific features of the amendment, to increase its efficiency.
main
- 递归实现八皇后问题,输出以0和1组成的数组组成。分页显示结果。-eight queens.
ss
- 非递归合并排序，用stack实现的。包含一个test.h头文件-Non-recursive merge sort and stack. Contains a test.h header file
stack
- 通过堆栈的简单应用实现10进制到任意进制之间的转换-Through the stack of simple applications to any hexadecimal 10 hexadecimal conversion between
datastructure
- 《数据结构》课程实习一，实现对线性链表和数组的基本操作-" Data Structure" Course Practice realize a linear linked list and an array of basic operations
Huffmantree
- 赫夫曼树： 按先序输入二叉树 数的结点是： 输入赫夫曼树的mm个权值： HuffmanCoding(HT,HC,&HT[mm].weight,mm) printf(HC,mm) -Huffman tree: sequence input by the first node is a binary number: Enter a Huffman tree mm Weight: HuffmanCoding (HT, HC, & HT [mm]. Weight, mm)
toposort
- 拓扑排序是网络中的确定逻辑先后顺序的一种算法，要求网络中没有回路-Topological sorting is the logical order of the network to determine an algorithm requires no loop network
deatvg
- 拉链法 建哈希表 数据结构 拉链法 建哈希表 数据结构-hash table data structure
shunxubiao
- 顺序表操作与实现，插入，删除，求长度，基本操作-Operation and implementation of the order of the table, insert, delete, find the length, the basic operation