（1）满足均匀分布的[M,N]区间随机数，其中M,N是正整数。 (2) 满足指数分布的[M,N]区间随机数，其中M,N是正整数。...

1.本程序由本人采用vc++ 6.0编写，包括了排序平衡二叉树的整套算法（包括插入、删除、查找以及其测试算法）。 2.运行myavl_vc.exe输入树的初始结点个数，确定后本程序将在内存中生成一棵相应结点数的二叉树，在此基础上你可以进行各种操作（插入、删除、查找以及测试其平衡性、排序性等） 3.每一个结点信息包括"商品编码"、"商品名称",且以"商品编码"作为关键字 4.初始生成的树的结点的商品编码为从1按顺序递增，商品名称为"生成的商品"加上商品编码 5.程序中的随机插入与随机删除是为了更好的测试程序的正确性和可靠性 6.随机插入（删除）时，程序将不断向（从）树中随机插入（删除）结点，每次随机插入（删除）都会进行平衡性与排序性的检查，如果树已经失去了有序性或平衡性，则会弹出树已失去了有序性或平衡性的提示并停止插入（删除）操作，当然你可以随时中断随机操作-1. The procedure I used vc 6.0 preparation, including the sequencing of the entire balanced binary tree algorithm (including insert, delete, search and test algorithm). 2. Running myavl_vc.exe importation of the initial tree node number, the procedures established in the memory of the formation of a corresponding nodes of a binary tree, and on this basis you can conduct various operations (insert, delete, search and testing their balance, sorting etc.) 3. each node information including "Product Codes," "trade names," and the "commodity codes" as the keyword 4. initial produ

课程设计用的报告和代码-curriculum design and the code report

解N元一次方程，从文件读入整数 N, 然后读入N*（ N+1）矩阵，得到解并输出到文件中。-Solution of N-linear equation, reading from a file into an integer N, and then read into the N* (N+1) matrix obtained solution and the output to a file.

双线程对一系列随机数进行归并排序，使用MFC的控制台程序-Dual-threaded on a series of random numbers to merge sort, using the Console application in MFC

民间标会的会员管理用的软件。是为一个顾客定做的！-civil standard to be a member of the management software. For a customized!

在安装多个打印机的系统中,如果没有指定打印机,打印内容将被自动输出到默认打印机.本程序指定打印机设置为默认window打印机.-printers installed in the system, if not specified printers, print content will be automatically output to the default printer. The procedures specified printer settings to the default window printers.

数据库索引功能 C 语言源码-database indexing functions C language source code

用链表存贮结构实现线性表的基本操作。（包括各种操作）-List storage structure used to achieve the basic operation of the linear form. (Including a variety of operation)

一个简单的学生成绩管理系统，身份为老师，学生，管理员，管理员为a ，密码也为a。可以完成人员的增删和成绩查询，修改

该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为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.