Prim 算法寻找最小生成树，用C语言实现，有完整的注释！

Implementing a queue data structure

二叉树有三种遍历方法，引用树的概念实现遍历-There are three methods of tree traversal, invoke the concept of tree traversal realize

根据先序和中序遍历的结果，重新构造二叉树-According to the results of the PreOrder and InOrder visit,rebuild the bitree

算法设计的动态规划中的最优二叉搜索树问题，是用VC＋＋编写的-algorithm design of dynamic optimal planning of two forks search tree problem by using VC++ prepared

中缀表达式转换为后缀表达式并求值 使用switch语句-Infix expression into a suffix for the value of expression and the use of switch statement

从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用. 算法平均时间复杂度: O(nlogn) -Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)

数据结构中各种排序算法的实现 还是排序性能的比较 -Data structure in a variety of sorting algorithms or to sort of realize the performance comparison

以前做的课程设计,可用于学习VB与ACCESS的连接!-done before the curriculum design, learning VB can be used in connection with ACCESS!

快速傅立叶变换，实现固定长度的快速傅立叶变换-Fast Fourier Transform, the realization of a fixed length of Fast Fourier Transform

数据算法，凉东问题-data algorithm, the cooler East problem