收费系统我的第一个系统

使用vc进行数据库编程实例：个人通讯录管理-use vc database programming examples : personal address book management

数据结构中图的相关操作,数据结构中图的相关操作-data structure of the plan related operations, data structure of the plan related to operation

TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves. we could check its leaves in terms of algorithm as preorder , midorder or postorder.-TwoEmbranchmentTree : As ancestor has its children, a tree has its leaves. we could check its leaves i n terms of algorithm as preorder. midorder or postorder.

程序是要建立一个哈弗曼树，并利用哈夫曼树求相应编码和译码，根据输入的一串电文（字符串）来设计哈夫曼树，并根据哈弗曼树求出每个字符相应的编码，最后根据已知的编码，随机组合输入编码串，根据哈弗曼编码和哈弗曼树求出译码内容。 主要输入形式为一串字符串例如：abcd 输入的范围就是这26个字母，不限大小写，定义最多输入的字符不超过100个。 输出的形式根据要求，输入字符串后，要输出每个字符及其权值（出现次数）； 然后再输入要译码的编码串，输出译码内容。

利用F90接口创建nc格式文件，并写入一个虚构的2维数据-use F90 interface to create nc format file

磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn-document optimal disk storage, disk based on documents n f1, f1, fn. each file on disk for a cylinder. N This document retrieval probability were p1, p2, and pn

大整数乘法的详细实行 比如说1246*2566用此法可降低时间复杂度并且能过有效算出-large integer multiplication detailed implementation of the 1246* 2566 for instance, tried to use this method can reduce the time complexity and can Guo calculated effective

[问题描述] 将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N） [输入] 待排序记录个数，各关键字的值。 [输出] 关键字从正负分开，正数在前 [存储结构] 待排序记录顺序存储。 [算法的基本思想] 快速排序算法每次任取一个记录的关键字为标准，将其余记录分为两组将，N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前。 #include using namespace std #define MAXNUM 100//设文件的最长可能长度 void sort(int* keys, const int len)//排序 -[Problem Description] N keyword to the integer sequence the entire record. keyword so that all non-negative Records with the keyword for the negative record, at least require the use of the additional space and time complexity of the algorithm is O (N) [imported] to be sort record number, The value of the keyword. [Output] keyword separate from the pluses and minuses are several former [storage structure] scheduling records to be stored sequence. [Algorithm for the basic idea] quick sort algorithm each time a record for any keyword as a standard, The remaining records will be divided into two groups, N-keyword

带通配符的字符串匹配算法源代码-with wildcard string matching algorithm source code

我们在学习外省市先进经验的基础上，结合教材管理工作实际情况和多年的工作经验，组织了专门人员与协力电脑公司利用Vb6.0程序语言和SQL数据库语言共同开发研制了“河北广播电-we learn advanced experience of other provinces and cities on the basis of materials management with the actual situation, and many years of work experience, organized with the help of specialized personnel computer companies use Vb6.0 programming language and SQL database language jointly developed "Hebei Radio