guanya

使用深度优先遍历最小路径树，根源是 A (Using depth-first traversal minimum path tree but root is A )

实现字符串基本上所有的功能，其中有KMP算法，有各种字符串的判别以及提取(it is really useful and wordenful)

在本文章里面，有各种举出算法的C语言实现 1、大数阶乘 2、大数乘法 3、任意进制转换 4、最大公约数 5、最小公倍数 6、快速傅里叶变换 7，字符串的替换，查找，截取 8、叉乘法求多边形的面积 9、快速，希尔，选择等各种排序 10、二叉树，链表，链栈 11、二分查找 12、求解线性方程组，也叫中国余数定理 13、求点到直线距离 14、Prim算法求最小生成器 15、判断点与直线的关系，俩条直线的关系 16、求排列组合数，俩矢量角度 ...... 等等基础算法的C语言代码实现(1, large factorial 2, a large number of multiplication 3, arbitrary binary conversion 4, the largest common divisor 5, the least common multiple 6, fast Fourier transform 7, string replacement, search, interception 8, fork multiplication method for polygon area 9, fast, Hill, choice and other sort 10, binary tree, linked list, chain stack 11, binary search 12, solving linear equations, also known as the Chinese remainder theorem 13, seeking point to a straight line distance 14, Prim algorithm for the minimum generator 15, determine the point and the relationship between the two lines of the relationship 16, the number of permutations and combinations, two vector angle ... And so on the basis of the C language code algorithm)

迷宫问题c源代码，大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标，输出所有可能的路径(Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths)

这是我在学习数据结构做练习时写的一个小程序，功能是在命令行下进行形如：23+34*3/4+(3*6+10)的四则运算，支持+,-,*,/,(,)进行整数运算。(This is a simple code about data structure.It uses to carry on four arithmetic operations with parenthesis.But now it only supports integer.)

n皇后问题构造法实现，比起启发式修补运行时间较长。(n Queen realize the issue of construction method, compared to a longer run-time heuristic repair.)

说明：  由数字1和0组成迷宫，0代表可走路径，程序会用坐标的形式给出每一步的走法(Composed by a maze of numbers 1 and 0, 0 to go the path, the program will use the coordinates given in the form of moves at each step)

包括链表的各项操作，添加、删除、修改等。还包括单项连标和双向链表。(including the operation, add, delete, revise. Also including individual targets and even two-way linked list.)

关于数据结构这门学科的源程序，系列四。 (About data structure this discipline the source program.)

数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)