qiongju

多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂(suoxiangshi jiajiancheng)

用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))

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

输入俩条线段的首尾坐标，用于判断俩条线段是否相交的(Used to determine whether the intersection of two line segments)

说明：  有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

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)

各种数据结构代码,欢迎下载,里面有JAVA,C,C++等等各种版本(Data structure and code, please download)

画图法实验数据结构中二叉树先序、中序、后序遍历和显示。(Paint Method in the first order binary tree data structure, in order, post order traversal and display.)

这是BFS算法的实现。用C语言实现的。好好学习吧。(This is achieved BFS algorithm. Implemented using C language. Learn it.)