北大ACM1455(Crazy tea party)

数据结构与算法分析C++描述 期末评分的东东 自己写的，有用吧・-Analysis of data structures and algorithms described in C++ to write their own final score Dongdong, useful bar

数据结构课程实验之一，关于汉诺塔的问题，简单的小程序-Experimental data structure, one of course, on the Tower of Hanoi problem, a simple applet

-罗塔，而且移动，可以清楚地看到整个过程

哈希表设计是数据结构中重要的一个项目，该程序详尽说明了哈希表的建立等过程。-hash wishes it is an important project in the structure of the data that the form is designed, this procedure proves exhaustivly hash wishes such course as the setting-up of the form ,etc..

引用枕善居的天宏钢构仓库管理系统 Ver 2.96，给大家分享-Quote pillow good home Tianhong Steel Structure Warehouse Management System Ver 2.96, to the U.S. to share

使VC连接数据库变的更简单-VC connect to the database so that a simple change

0-1背包问题，用VC++实现，是算法设计中比较重要的问题-0-1 knapsack problem, using VC++ Realize is that algorithm design more important issue

BM关键字查找算法，在用于查找子字符串的算法当中，BM（Boyer-Moore）算法是目前相当有效又容易理解的一种，一般情况下，比KMP算法快3-5倍。-BM keyword search algorithm used in the sub-string search algorithm which, BM (Boyer-Moore) algorithm is quite effective and easy to understand A, under normal circumstances, more than 3-5 times the KMP algorithm quickly.

哈夫曼树及哈夫曼编码，经过测试可用的，快来下载啊！-Huffman trees and Huffman coding, tested available, Come download ah!

文章详细讲解分支限界的基本思想，单元最短路径问题，装载问题，0-1背包问题，旅游售货员问题等。-Detailed article on the basic idea of branch and bound, the shortest path problem unit, loading issues ,0-one knapsack problem, travel salesman problem.