此程序为求两个数的约数,将他们输出,将这两个数的最大公约数输出...

用O(nlogn)的算法对Cograph进行识别-O (nlogn) algorithm for the identification of Cograph

大型数据库，最基本的PL/SQL语句，及其基础编程。-Large databases, the basic PL/SQL statement, and its basic programming.

程序分析，主要功能有，但界面还没加上，基本实现了功能要求。-program analysis, the main function, but with no interface and the basic realization of the functional requirements.

2.1将n个人围成一圈，m为未进入游戏前的先行码，用来淘汰第一个出 局的人，然后依次给出淘汰者的密码，根据输入的密码来确定下一个淘汰是哪一个，并依次输出被淘汰的人对应的号码。 2.2用单向循环链表实现操作。-2.1 n personal cordons m not yet entered the game before the first yards out for the first out, then eliminated were given the password, the password to determine under which a one-out, and turn out the output of the corresponding number. 2.2 List circle with a one-way operation to achieve.

数据结构与算法-程序、素材---使用矩阵类-Data Structures and Algorithms- procedures, materials--- the use of matrices

该程序能够实现傅立叶的快速转换和放转换用vb语言来实现，整体效果不错！-the procedures to achieve fast Fourier transformation and the conversion put vb language used to achieve the overall effect was excellent!

假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。^AL ABL ACR BDL CEL CFR DGR FHL ^^L -Assuming the following description of the triple (F, C, L/R) sequence of a binary tree of all the input side (where F that identifies the parent node, C, said child node ID, L/R that C is F, left or right child child), and triples in the input sequence, C is the emergence of a hierarchical order. Node identity is established character types. F = " ^" C for the root identity when, if C is also a " ^" , then enter the end. Test preparation algorithm, the input sequence of triples binary build the binary tree list, and in order to sequence the output

数据结构　 哈希表应用-data structure Hash Table Application

数据结构与算法-程序、素材二叉链表类派生应用类测试-Data Structures and Algorithms- procedures, materials list binary application-type test derived category