数值计算的源代码，包括二分法，和弦表，肺伯格算法…

c++链式队列的实现头文件如下： typedef int Item; typedef struct node * PNode; typedef struct node {  Item data;  PNode next; }Node; typedef struct {  PNode front;  PNode rear;  int size; }Queue; /*构造一个空队列*/ Queue *InitQueue(); /*销毁一个队列*/ void DestroyQueue(Queue *pqueue); /*清空一个队列*/ void ClearQueue(Queue *pqueue); /*判断队列是否为空*/ int IsEmpty(Queue *pqueue); /*返回队列大小*/ int GetSize(Queue *pqueue); /*返回队头元素*/ PNode GetFront(Queue *pqueue,Item *pitem); /*返回队尾元素*/ PNode GetRear(Queue *pqueue,Item *pitem); /*将新元素入队*/ PNode EnQueue(Queue *pqueue,Item item); /*队头元素出队*/ PNode DeQueue(Queue *pqueue,Item *pitem); /*遍历队列并对各数据项调用visit函数*/ void QueueTraverse(Queue *pqueue,void (*visit)());

有关路由算法的程序，具体要求见压缩文件内容-Routing algorithm of the procedure, specifically asked to see the contents of compressed files

一个解码的类，常用在条形码的解码中，是老外写的比较实用-a decoder category, commonly used in bar code decoding, the foreigner is more practical writing

实现了插入排序，希尔排序， 冒泡排序，快速排序，选择排序，堆排序和归并排序，以及可以对排序的性能进行分析，较适合用作排序算法的学习-achieved insertion sort, Hill, in order Bubble Sort, quick sort, select, in order of ranking and sculpture merge sorting, and sequencing can analyze the performance and more appropriate for the learning algorithm

本示例主要解决GridPanel+TabPanel+ComboBox，动态生成数据，无须任何配置，并且大部分代码的实现都可通用,并且大量减免了在Html页面里静态配置数据列所带来的麻烦，这是很有用的技巧.为了大家更好的更方便的使用本示例,就附加了一个功能:只要添加本地的数据库连接,选择数据库里面的表,就可以对代码进行方便的测试. 更多可以查看包里的项目说明，并附有图片展示。 项目结构上使用三层，为了增加代码的清晰和阅读性，无用的代码都已经清理干净，因为是动态获取并显示任意数据库的任意数据表，所以在这里也不用实现相关实体. -This example is mainly to solve GridPanel+ TabPanel+ ComboBox, dynamically generated data, without any configuration, and most of the implementation of the code can be generic, and a large number of relief in a Html page inside a static configuration data out of the trouble, which is very useful skills. In order to better and more convenient for everyone to use this example, we added a feature: as long as add a local database connection and select a table inside the database, you can easily test the code. More to see the bag, project description, along with pictures showing. Using the three-tier project structure, in order to increase code clarity and readability, useless code have been cleaned up because it is the

数据结构大作业的非界面版-large data structure of the non-operational interface version

顺序栈的基本操作，一共9个，与吴伟民数据结构课本完全一致，用C实现-order stack the basic operation, a total of nine, and Xiulan WU Weimin textbooks data structure is fully consistent with achieving C

数据结构里面实现图：拓扑排序、最小生成树、关键路径、深搜、广搜、优先路径

学生数据库的管理与实现，c语言开发环境，功能齐全-Students and implementation of database management, c language development environment, full-featured

是对加快程序运行时间，合理程序类型最有效，最有说服力的一本书-Introduction to Algorithm