SQLET分词算法，一个C程序，供大家参考。

VFP代码录入小程序,小例子,大家看看,可能会有帮助,好了-VFP code entry procedures for small, small examples, we see that may be helpful, a good

大二时做的稀疏数组课程设计，希望对大家有帮助-Sparse array of curriculum design, we want to help

Window Example with Additional Global Progress Bar and Command Button.

查字典程序,可以简单查阅你想要的单词-dictionary procedures, a simple inspection of the word you want

我写一个积分器,比赛时候用的,本来是给学校写的,结果他们没用,郁闷吧-I wrote an integrator, when the competition could have been written to the school, their useless, it depressed

机场程序

给定N个大小不等的圆c1,c2,…,cn，现要将这N个圆排进一个矩形框中，且要求各圆与矩形框的底边相切。圆排列问题要求从N个圆的所有排列中找出有最小长度的圆排列。-given N ranging from the size of the circle c1, c2, ..., cn, when it is 000 yen N discharged into a rectangular box, demanding the rectangular box with a round of the hemline tangent. Yuan with the problem demands from the N-round identify all with a minimum length of the round with.

api制作电子书-api produce electronic books

Delaunay三角网作为一种主要的DTM表尔法，具有权其广泛的用途。经过二十多年来的研究，它的生成算法巳趋于成熟。本文简要介绍了Delaunay三角网的定又及其特性，在简单回顾和评价了分割―归并法，逐点插入法，三角冈生长法等三类主沈算法的基础上，提出了一个融以上算法优点于一体，兼顾空间与时间性能的合成算法。经测试，一般情况下它的运算速度远快于逐点插入法，与分割―归并法相当，较好的情况下快于分割―归并法。-Delaunay Triangulation as a major DTM Fall table, with the right to its extensive use. After 20 years of study, which had been generating algorithm is maturing. This paper introduces a Delaunay Triangulation and another set of characteristics, in a brief review and evaluation of the divide-conquer method, point by point insertion method, the supraspinatus Growth Triangle law Shen three main algorithm on the basis of the above algorithm into an advantage in that balanced space and time performance of synthesis algorithm. After tests, under normal circumstances it"s computational speed much faster than the insertion point by point, and the divide-conquer method rather, a better situation faster than divide-conquer method.

Using GDI and GDI+ mixed drawing rubber band lines_src