数据结构中的各种排序,只要输入一定的数据就可以实现排序,显示结果...

学习C语言时，编写的一个多项式刮号检查程序 主要用栈实现的。-C language study, prepared by a polynomial scratching, the main inspection procedures Stack realized.

能够连接各种数据库的API-to connect to various databases API

这是一个好用的MD5的C++类；这个类可以加在控制台 程序中也可用在MFC中， 并且提供了详细的错误处理 函数，是一个安全的类。例程是一个MD5的MFC程序， 支持字符串和文件两种输入。 LPCSTR TargetFile(char *filename=NULL) //计算文件的MD5值 void TargetStr(LPCSTR str) //计算字符串的MD5值 LPCSTR GetDigestKey() //取MD5运算后的结果 LPCSTR GetErr() //如果有错误，取错误字串-This a user-friendly MD5 C; This category can be added to the Console program is available in MFC, and provided a detailed error handling function, is a safety class. MD5 is a routine MFC procedures, and documentation to support a string of two input. LPCSTR TargetFile (char* filename = NULL)// calculate MD5 value of the document void TargetStr (LPCSTR str)// calculate MD5 string value LPCSTR GetDigestKey ()// Operational MD5 from the results LPCSTR GetErr ()// If there were mistakes from the wrong string

new database system using php

类模板,助于参考及编写代码,代码以数据结构值的排序方式及链表操作为主. -Class template, reference and help to write code, the code value to the data structure and linked list Sort-based operation.

VB为前台，SQL_SERVER为后台的关于贸易的数据库编程-prospects for VB, SQL_SERVER background on the trade of Database Programming

将网页文件中的词汇提取出来，放入一个单独的mdb格式数据库-Page document vocabulary extracted into a separate database mdb format

C语言常用算法源代码,非常好用非常好用-C language source code commonly used algorithm, a very handy very handy!

迷宫问题的一个简单程序，此程序简单易懂，很好理解，适合初学者看-Problem a simple maze procedure, this procedure simple and easy to understand, well understood, suitable for beginners to see

1．定义哈希表数据结构。 2．除留余数法做为哈希函数、 H(key) = key P 用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。 3．编写函数，求查找成功时的平均查找长度（ASL）。-1. Define hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing with linear probing methods of conflict resolution, write a function to achieve the hash table making process and output of the hash table. 3. Write function, seeking to find success, the average search length (ASL).