用perl写的Oracle管理工具

aql介绍，适合入门者学习 aql介绍，适合入门者学习-Aql introduction, suitable for beginners to learn Aql introduction, suitable for beginners to learn

its about the bubble sorting.

n!不为0的最后一位，可以输出千万级别的阶乘最后一位-n! not the last one is 0, you can output level factorial million last

一百个铜钱买了一百只鸡，其中公鸡一只5钱、母鸡一只3钱，小鸡一钱3只，问一百只鸡中公鸡、母鸡、小鸡各多少）。 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

立春葆的数据结构李春葆：数据结构习题与解析（C语言版）.pdf-Li-Chun Li Chun-bao-bao of the data structure: Data structure and analysis of exercise (C language version). Pdf

64位以内Rabin-Miller 强伪素数测试和Pollard rho 因数分解算法的实现-64 within Rabin-Miller-puppet prime testing and Pollard rho factorization algorithm implementation

从文件里读入数据，计算各课成绩的平均分，最高分，最低分，学生的加权平均成绩，并生成分析数据。-Reading from the document into the data to calculate the class average performance, the maximum points, minimum points, the weighted average performance of students, and generate analytical data.

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.

某心理咨询公司有三个顾员，其编号为1~3，他们上班时间为每天的8~17点，请打出某天他们接待咨询的时间。-a psychological consulting company three LAB, the No. 1 ~ 3, They go to work every day for the 8 ~ 17:00, making Somewhere they receive counseling time.

数据结构大作业－变长记录类库-data structure large operations- variable length record library