xianxingbiaolianjie

吴伟民版数据结构每个算法的c实现方法，并模块化处理，将各个功能分开编程，有助于移植使用(failed to translate)

链表的建立及相关处理，包括排序，删除，初始化，增加，删除等等，且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through )

此代码为折半查找算法，适用于有序表，欢迎各位下载(This code is the binary search algorithm for ordered lists )

江苏大学数据结构研究生试题2009Jiangsu University graduate examination papers(Jiangsu University graduate examination papers)

数据结构 二叉树的操作，可以对二叉树进行最基本的操作，先建立二叉树。(The operation of the binary tree, binary tree with the most basic operation, first create a binary tree.)

/*快速排序：以待排序元素中的第一个元素作为基准将带排序的元素分为三组 *大于基准元素为一组置于基准值的右边，小于基准值的元素为一组置于基准值的左边， *基准值为一组，这样就找到了基准元素的位置就确定了 *如此递归调用。直到每一组的low==high，即实现了排序的要求。 */ (/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)

说明：  数据结构基本算法实现。包括栈、二叉树基本运算实现，同时包含整数计算器的完整实现。(The basic algorithm data structure. Including implementation of stack, binary tree basic operations, and a complete implementation of an integer calculator.)

通过学习奥赛培训课程，利用回溯加递归的编程技巧完成的迷宫问题(Training courses through learning Orsay, plus use of recursive programming skills back to complete the maze problem)

使用不同的方法解决背包问题：本算法采用的是动态规划方法，比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)

简单的汉诺塔算法，采用归约算法的思想，实例是三个盘子，三个柱子(Simple HANOR algorithm)