资源列表
TopTenWords
- 在大数据文件中，找出现次数前十的单词。这个文件不能一次加载如内存，其中用到了自己写的快排函数。-In a large data file, find the top ten the number of occurrences of the word. This file can not be loaded once, such as memory, which uses a fast row to write their own functions.
Poligonal mesh
- realization of poligonal mesh in OpenCv
matching-brackets
- 利用c++数据结构 栈 解决括号匹配问题 -Use c++ to solve matching brackets
UFApp
- write an application UFApp that 1. Prompts for a file name. 2. Reads the first integer, which is the number of sites. 3. Reads each pair of integers, p and q, representing sites and if not already connected, connects by calling union(p,q).
VCPP
- 一个可视化的程序，用于更换图标，更改界面颜色以及一些其他常用功能-A visualized program of VC++,using to change the icons and change the color of the interface.
Eulerpath
- 用于解决起点和终点非同一点的欧拉通路 一笔画问题程序。-Solve the start point and the end point are diffient point Euler path problem a stroke problem.
pr01_SpaMatSMC
- 稀疏矩阵的一种实现，使用命令行测试该程序。具体内容请看代码。-An implementation of sparse matrix, using the command line to test the program. Look at the specific content of the code.
data
- 数据结构常见结构，表，队列，栈。主要用来管理存储数据和运算。-Data structures common structures, tables, queues, stacks. Mainly used to manage data storage and computing.
counting-sort
- 计数排序法的典型例子，算法设计与分析基础，第七章时空权衡的基数排序法C++实现.-Typical examples of counting sort method, algorithm design and analysis based on Chapter VII of the space-time trade-offs to achieve the radix sorting method C++
palindrome_mem
- 包含了回文还有内存分配的基本函数，源码内含注释，可供读者理解。-Also contains a palindrome basic memory allocation functions, source code containing notes, for readers to understand.
Josephus
- Josephus问题：设n个人围坐在一个圆桌周围，从第s个人开始数数，数到m的人，让他出局，然后从出局的人的下一个人开始重新开始数数，数到m的人，再让他出局，……，知道全部出局为止-Josephus problem: Let n individuals sitting at a round table, from the first s personal began to count, count to m, let him out, then the next person out of th
FreeTree
- 无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径-Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T