Pratical Visual C++6.0 chapter examples

哈弗曼编码。输入需要编码的大小写字符即可得出各个字符的编码-Havermann coding. Enter the desired case characters can be encoded in various character encoding obtained

计算流体算法求解时必须使用TDMA直接求解程序，应用非常之多，尤其是流体数值计算和传热学应用居多，通过一维引申到二维和三维，扩展了算法的使用局限性

使用vc6.0我自己制作的模拟银行结帐系统。 用txt代替了数据库。 用于初学者学习。-vc6.0 my own use of the simulated bank checkout. Txt instead of using a database. For beginners to learn.

0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right

测试USB接口是否能用，若出现错误，则显示出错原因，推荐解决方法-USB interface can be used to test whether, if an error occurs, display error causes, recommend solutions

要求随机关生一个序列，任意查找其中一个元素时，采用二分搜索法实现，并且还能显示查找次数。使用二分法首先要使序列列按从小到大排序，因此程序中还要有排序功能。- there is a random series ,when looking for any an element in this series,we can achieve this by the method of bisectional searching,also the number of search times will be displayed.when using this method ,first of all you should sequence the series bigger and bigger.For this reason the program shoule have the founction of secquencing.

挑战你的心理极限…… 建议不要再夜间独自观看……否则后果自负。-Challenge your mental limits ... ... We do not recommend re-watching alone at night ... ... or else your peril.

简单的C#程序，校园歌手评分系统，去掉一个最高分，去掉一个最低分，最后算出平均分。-A simple C# program, the campus singer scoring system, removing a highest score, get rid of a minimum hours, the last calculated average.

朋友给的一个源代码，自己也看不懂，据说有用-a friend to the source code itself would not understand, reportedly useful

拟实现银行帐户 拟实现银行帐户 拟实现银行帐户 -拟实现银行帐户