两结构分析程序，用于制备Fortran90，主要用于结构…

C#编写的应用程序，在VS2005下开发，包括GDI+的相关基本操作以及SQL Server数据库的操作-C# Prepared applications, in VS2005 under development, including GDI+ Relevant basic operation and the operation of SQL Server database

包裹ca.pfv.spmf公司.关联规则.TopKRules;

AVL tree display format in two dimensional

K平均聚类法，比较好用，又需要的赶紧下吧-K-clustering method to compare easy to use, but also hastened to the needs of the next bar

wince扩展数据库编程中利用ADO访问Access数据库-wince extended database programming using ADO to access Access database

我写的数据结构小程序是关于排序算法的，功能比较全-The little procedure of data structure that I wrote is about arranging in an order the algorithm, the function is more complete

声明结构 体，该结构体包含一个值，和一个指向下一个结点的指针next,初始化时头结点指针指向自身，每增加一个节点，使加入的结点的next指针指向头结点，使t头结点的next指针指向插入结点。 源代码 在vs2012 运行通过，界面使用菜单进行操作选择，友好方便，值得参考

学校成绩管理系统 2006 如果遇到MD5加密文件，而又不知道的密码的， 请在数据库中换上这组加密的数据吧 469e80d32c0559f8 那么密码就是admin-School management system in 2006 if they are MD5 encrypted file, not knowing the password, please put in the database encrypted data for this group it is the admin password so 469e80d32c0559f8

一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)

该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it"s time complexity of O (n), but this sort known to be applicable to sort out the range, and if the upper and lower limits of the relatively large margin, space consumption is relatively large.