资源列表
Data_Struction_complex
- 数据结构作业 复数运算代码。 可处理复数加减乘除运算。 图形界面。-data structure complex computing operations code. Can handle complex arithmetic operations. Graphical interface.
Data_Struction_prim_MST
- 数据结构作业代码。 最小生成树 Prim实现。 win32 Console界面。-operation code data structure. Prim achieve the minimum spanning tree. Win32 Console interface.
Data_Struction_sort_search
- 数据结构作业。 排序和数据检索比较演示程序。 图形界面。-data structure operations. Sequencing and comparison data retrieval demonstration program. Graphical interface.
my_strcmp
- 常用算法 自定义strcmp 比较两个字符串是否匹配(本人第一个算法)-commonly used algorithm defined strcmp compare whether two strings match (I first algorithm) hee h
stringprocess
- 字符串模式匹配，查找子串加以代替，有两种模式匹配算法-string pattern matching, substring search to be replaced, there are two types of pattern matching algorithm
treeoperate
- 树的各种基本操作都包括了，四种遍历，查找节点等-tree basic operations are included, four traversal, identify nodes
serach
- 二叉排序树的查找算法，用非递归做的，查找删除节点等操作-Binary Tree Search ranking algorithm, the use of non - recursive so that you delete nodes, etc
sortlinktabel
- 对链表进行排序，时间复杂度O（n2),类似于插入排序的思想-right sort, time complexity O (n2), similar to the sequencing of the insert thinking
codeandencode
- 对一篇文章编码和解码，采用huffman 树的方法-an article on encoding and decoding, using the Huffman tree
graphic_algorithm
- 每对节点间最短路径 Floyd-Warshall 算法 D[i,j]表示从i到j的最短距离； P[i,j]表示从i到j的最短路径上j 的父节点-between each pair of nodes Shortest Path Floyd-Warshall algorithm D [i, j] said from i to j is the shortest distance; P [i, j] said from i to j the shortest path
Strassen_8
- Strassn关于两个矩阵相乘的算法，同过分治原理把两个n*n的矩阵阶各分解成四个n/2*n/2阶的矩阵，当分解出来的矩阵阶数等于2时，求借各个小矩阵，若阶数大与2，就递归的调用前面方法，直到分解成2*2的子矩阵为止。-Strassn on two matrix multiplication, the algorithm, with the governing principle over two n * n matrix of the band decomposed into 4 n / 2
Estimate
- 理解并掌握分析回溯算法效率的方法。 使用Estimate算法就8皇后问题给出效率估算 -understanding and mastery of backtracking algorithm efficiency analysis method. Use Estimate on 8 Queen's algorithm is efficient estimation problem