民间标会的会员管理用的软件。是为一个顾客定做的！

一个带界面的在线测试系统，从数据库中随意抽题，在线回答，并且反馈答案。-An interface with the online testing system, arbitrarily drawn from the database title, on-line to answer, and the feedback answer.

用于餐厅管理以及各种人事，营业流水查询及历史查询-For Restaurant Management and a variety of personnel, business inquiries and the history of water inquiry

可以在打印之前并在程序内直接设置所有的参数!-in print before the procedure and direct all the parameters set!

建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.

北大OJ 1417题的标程代码，并查集和深度优先搜索的经典实现-OJ 1417 North title scalar-way code and search sets and the classic depth-first search to achieve

题目:稀疏矩阵是指那些多数元素为0的矩阵.利用稀疏特点进行存储和计算可以大大节省存储空间,提高计算效率.实现一个能进行稀疏矩阵基本运算的运算器.基本要求:以带行逻辑连接信息的3元组顺序表表示稀疏矩阵,实现两个矩阵相加,相减和相乘的运算.矩阵的输入形式采用3元组表示,而运算结果的矩阵则以通常的阵列形式列出.概要设计:1.以带行逻辑连接信息的3元组顺序表表示稀疏矩阵2.本程序包含2个模块:(1) 各集合定义模块(2) 主程序模块-topics : sparse matrix refers to those elements for most of the matrix 0. Using sparse features storage and computation can be greatly reduced storage space and improve computational efficiency. One can achieve for sparse matrix operations basic computing device. Basic requirements : OK logical connection with the three yuan Information Group the order said the sparse matrix table to achieve two matrices together, subtract and multiply arithmetic. Matrix entry forms using three yuan Group said, and the results of the matrix operations while the usual array listed. summary of design : 1. in line with the logic of information linking the three element group said sparse chronology matrix 2. this program contains two modules : (1) Set module (2) main program module

数据备份与恢复源码,给需要的一个参考,可以直接运行-Data backup and recovery source, a reference to the need, you can directly run

Floyd 算法，创建有向图，无向图，有向网，无向网的算法-Floyd algorithm, create a directed graph, undirected graph, directed networks, undirected networks algorithm

数据结构相关知识写的，二分查找的相关代码-2 minutes to find the relevant code

1．定义数据结构。 2．编写函数，实现插入排序算法。 3．编写函数，实现希尔排序或快速排序等效率较高的算法。-1. Defined data structure. 2. Write a function to achieve insertion sort algorithm. 3. Write a function to achieve Hill sort or quick sort, etc. more efficient algorithms.