这是一个练习链表的扑克牌程序，可以自动发牌，比较大小。如果想和计算机对战，只需要稍微改动一下程序即可。...

计算10000以内的阶乘,计算阶乘的程序-calculation 10,000 within the factorial calculated factorial procedure

poj1125用二叉堆优化的Dijkstra算法-poj1125 binary heap using the Dijkstra algorithm optimization

本人制作的8位CPU,有简单的加减,输入,输出操作,希望大家好用-I produced eight CPU, has a simple addition and subtraction, input and output operations, I hope everyone use

一个小型的数据库图书管理系统，较全的功能模块-A small library management system database, representing a full-function modules

实现了银行家算法，操作系统课程设计时编写的，能够成功运行-The banker" s algorithm implementation, the operating system designed to prepare the curriculum, be able to run successfully

北大ACM1003（Hangover）-North ACM1003 (Hangover)

二叉树遍历 包括先序遍历 中序遍历 后序遍历 求结点个数 求树的深度-Including the first order binary tree traversal traversal sequence in order to postorder traversal node number and ask for the depth of

Fir filter的设计,FIR滤波器系数-Fir filter design, FIR filter coefficients

从数组中 任取一个元素 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)

实现文本格式文件中的括号匹配. 匹配算法采用堆栈来实现. 文件读取异常还需完善的人性化一些-Text format documents matching brackets. Matching algorithm uses the stack to achieve. Paper anomaly needs to be well-read human nature of some `` ``