Huffman

算法设计与分析的习题及题解，希望大家能喜欢。-Algorithm design and analysis solution exercises and questions, I hope everybody can like.

假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)

一个表达式和一个二叉树之间，存在着自然的对应关系。写一个程序，实现基于二叉树的表示的算术表达式Expression的操作。 基本要求 1.ReadExpr（E） 以字符序列的形式输入语法正确的前缀表示式并够着表达式E。 2.WriteExpr（E） 用带括弧的中缀表达式输出表达式E。 3.Assign（V,c） 实现对变量V的赋值（V=c）,变量的初值为0。 4.Value（E） 对算术表达式E求值。 5.CompoundExpr(P,E1,E2) 构造一个新的复合表达式（E1）P(E2)。 (Between an expression and a binary tree, there is a natural correspondence relationship. Write a program to achieve the operation of the binary tree-based representation of the arithmetic expression Expression. The basic requirements for input grammatically correct prefix expressions 1.ReadExpr (E) in the form of a sequence of characters and enough with the expression E. 2.WriteExpr (E) output expression E infix expression with parentheses. 3.Assign (V, c) the assignment of the variable V (V = c), the initial value of the variable to 0. 4.Value (E) E evaluates arithmetic expressions. 5.CompoundExpr (P, E1, E2) to construct a new composite expressions (E1) P (E2).)

c语言编写规范，主要介绍编程中如何写出实用性以及易于阅读的代码，方便代码的维护和升级。(c language specification describes how to write programming code for practicality and easy to read, easy to code maintenance and upgrades.)

使用fdtd算法的人都知道这是初学fdtd的入门程序,很简单的程序但是能起到很重要的作用哦()

JTDS驱动，好用的sql server驱动程序哦-sdfsofjesfjsljflsjfdsljfslfjsljflsjflsjfljdslfs

db.* (pronounced dee-be star) is an advanced, high performance, small footprint embedded database for open source operating systems.-db .* (pronounced dee-be star) is an advanc ed, high performance, small footprint embedded database for open sou rce operating systems.

一款社区医疗系统，对于领取药物，医药，员工工号，挂号，出勤，都可以在数据库中保存起来，比较适合中小医院，对于所要的基础硬件比较低的企业同样适合

一个ADO+VC的源码，适用于初学者,里面还有其他控件用法-A ADO+ VC source for beginners, there are other controls usage

此代码为折半查找算法，适用于有序表，欢迎各位下载(This code is the binary search algorithm for ordered lists )