c language data structure, you can use a free download without registration

提醒的例子，大家可以去看看 -Remind example, we can go and see

用c++写一个售货员问题。这是高级算法中除了红黑树中最难的一个了。是研究生课程中的的程序实现-used to write a salesman problem. This is in addition to the High algorithm RED-BLACK TREE which one of the most difficult. The postgraduate courses in the program

用列表实现的队列和栈的算法，用接口和实现的结构组织。 原来打算一个通用的包含所有数据结构算法的接口以及实现集，由于时间问题，只是做了一点点，作为数据结构算法和设计思想的一个简单范例以及尝试吧，希望和大家多讨论。 里面附有使用实例，以及可执行文件，适合初学者！-used to achieve the queue list and stack algorithm, Interface and realization of the structure. The original intention of a common data structure contains all the interfaces and algorithms to achieve set, as a matter of time, but only a little, as the algorithm and data structure design of a simple model and try it, and we hope that more discussion. Inside with the use of examples, as well as executable files, suitable for beginners!

简单数据库管理系统-simple database management system

学习C语言时，编写的一个多项式刮号检查程序 主要用栈实现的。-C language study, prepared by a polynomial scratching, the main inspection procedures Stack realized.

把老师给的PPT，上传了。 是说数据结构。-The teacher to the PPT, uploaded. Is that data structure.

一道北大acm的试题，用双向链表实现模拟内存分配的程序-1 Peking University acm of examination questions, with two-way linked list of memory allocation procedures for analog

C++控制台程序，在不知道城市方位的情况下对某个城市的餐馆和小吃店进行导航定位。使用链表数据结构，采用继承的方式进行类的编写实现餐馆导航。

比较六种排序算法，其中包括快速排序，冒泡排序等内容的速度以及空间复杂度。-Comparison of the six sorting algorithms, including quicksort, bubble sort etc. the speed and space complexity.

0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.