data structure Shortest Path

堆栈的基本功能实现,数组方式实现-stack to achieve the basic functions, arrays means

详细是描述了如何将一个数据集导出为Word文档，整个示例是个完整的程序，有相关的函数和调用说明，每个函数都有相关的注释，对于没有接触过此类开发的程序员应该说非常有用。非常欢迎大家下载。

某银行拟开发一套ATM取款机系统，实现如下功能： 1、开户（到银行填写开户申请单，卡号自动生成） 2、取钱 3、存钱 4、查询余额 5、转账（如使用一卡通代缴手机话费、个人股票交易等） 现要求对“ATM柜员机系统”进行数据库的设计并实现，数据库保存在D:ank目录下，文件增长率为15 。 -Intended to develop an ATM of a bank teller machine system to achieve the following functions: 1, open an account (complete bank account opening application form, card number, automatically generated) 2, to collect the money 3, save four, query the balance of 5, transfers (such as the use of a Cartoon payment of phone calls, personal stock, etc.) is called for " ATM ATM system" for database design and implementation, the database stored in D: bank directory, the file growth rate of 15 .

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.

几种常用排序算法的效率比较,通过测试可得出这几种排序算法的优劣.-several commonly used algorithm efficiency comparison, the test may come this algorithm several merits.

马跳棋盘递归算法(TC实现,并提供示意图),可移植到任何C编译器-Ma checkerboard recursive algorithm (TC achieved, and to provide diagram), and can be transplanted to any C compiler

c语言编写的哈夫曼程序,运行通过的!根据输入构建哈夫曼树.-prepared by Huffman, the running through! According to the importation of construction Huffman tree.

在DOS环境下的最小二叉树程序，比较简单，可供大家学习参考-DOS environment in the smallest binary tree procedure is relatively simple for everybody to learn the reference

各种排序算法，ＳＨＥＬＬ　ＭＥＲＧＥ，还有随机数的生成　-various sequencing algorithms, SHELL Merg, Random Number Generation

利用哈夫曼编码进行通讯可以大大提高信道利用率，缩短信息传输时间，降低传输成本。但是，这要求在发送端通过一个编码系统将待传数据进行预先编码；在接受端将传来的数据进行解码（复原）。对于可以双向传输的信道，每端都要有一个完整的编/译码系统。试为这样的信息收发站写一个哈夫曼的编译码系统。（难易程度：高）