资源列表
ClosestPt
- 采用分治算法找距离最近的两点，点数按输入给定，随机产生。能达到1000000个点。-use divid and conquer method to find the nearest points.
knapsack
- MFC写的用动态规划法解决0-1背包问题。-solve 0-1 knapsack problem using dynamic programming.
LIS
- MFC写的使用贪心算法求最小递增子序列。-calculate the longest increaing sub-sequence.
SortCmpCode
- 比较几种常见的排序算法：插入排序，快排，归并排序等。-compare several common sorting algorithms, such as inserting sort, quick sort, merge sort, etc.
xianxingbiao
- 数据结构课程中，线性表实验源程序，用c++做的-Data structure course, the linear form experimental source, using c++ to do
Level_C
- 从文本文件输入n个同学的姓名、性别、成绩，按成绩又高到底的顺序输出所有学生信息，分别求出男同学、女同学的平均成绩并输出。-From a text file input n students in the name, gender, achievement, merit-based and high in the end the order of the output information for all students, respectively, find the male student
05
- 1.接受原始数据：从终端读入字符集大小n，n个字符和n个权值，建立哈夫曼树。2.编码：利用已建立好的哈夫曼树，对文件中的正文进行编码。3.译码：利用已建立好的哈夫曼树将代码进行译码。4.打印编码规则：即字符与编码的一一对应关系。-1. Accept the raw data: From the terminal reads the character set size n, n characters, and n-weights, the establishment of Huffman tre
poop
- Polynomial operation
BinaryTree
- 二叉树代码,可以实现二叉树的建立和二叉树递归遍历。-Binary code, can achieve the establishment and binary recursive binary tree traversal.
word
- 二叉树遍历（二叉树的各种遍历）、图的遍历（图的各种遍历），停车场的设计（堆栈，队列的设计）-Binary tree traversal, graph traversal, car park design
database
- Simple database for 2-5 person. You can store name, lastname and phone number and edit in any way. For student which start with C++ language.
xueshengchengjifenxi
- 这是我在学习数据结构的一个实验题目：学生成绩分析，里面有我自己做的程序源代码供大家学习，借鉴。-This is my data structure in an experiment to study the subject: student performance analysis, which do have my own source code for all to learn from