二叉树与二叉链表

本书总结了历届国际奥林匹克竞赛（IOI）的试题特点及我国参赛选手的培训经验。书中许多例题取自历届大赛的试题及中国队选手的训练题目，针对问题讲解了解题的关键思路及如何灵活运用有关的算法知识。-the book summarizes the successive international Olympiad (IOI) and the characteristics of the questions my players training experience. Many examples from the book the previous contest questions and the Chinese team"s training topics dealing with the problem of solving the problems on the key ideas and how flexible use of the algorithm knowledge.

在设计会计软件时,常常要把小写金额转换为大写金额,通过本例,你只要输入小写数字,即可转为大写金额.-accounting software in the design, it is often the amount should lowercase to uppercase conversion rates, through the cases, as long as you input lowercase figures, the amount can be converted to uppercase.

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

操作系统中的文件是通过文件目录项来管理的，为了管理和查找的方便，按层次把文件目录项组织起来，同一层上的目录构成该层上的目录，第一层为根目录，一下为各层子目录。 假设以一串字符代表一个文件，每个字符表示一个记录。 在建立上述目录结构的基础上，建立相应的管理系统并要求完成以下各项操作： 1． 一次建立各个文件 2． 查访两个用户的所有文件 3． 查访用户sun 是否有文件AB 4． 删除用户sun的文件AC,然后在分别查访两个用户的全部文件，检查是否已经删除文件AC 5． 撤销用户sun,并检查是否被删除 6． 删除用户sun的全部文件，然后在撤销sun用户，在查访用户sun, 检查其是否已被撤销。 在建立一个新用户及新用户的两个文件，然后查该两个用户的所有文件-operating system, the paper is to document catalog items to the management, in order to manage and facilitate the search, according to the document level directory entries organizations, the same floor on which constitute the directory contents on the floor, the first layer of the root directory to look for levels of subdirectories. Assuming that the representative of a string of characters, each character expressed a record. In establishing the directory structure on the basis of the establishment of a corresponding system of management and asked to accomplish the following : 1. Once established two separate files. Visits to the two users of all three docum

通过随机数据比较各排序算法的关键字比较次数和关键字移动次数，以及执行时间，取得直观感受。 实现各排序算法，分别进行以下各组比较，并进行总结。

VB精典SQL数据库开发源代码-VB classic SQL database open source

数据库实例，提供了汉字首字母转换的详细信息，相信大家能得到。

多线程进行二分排序法，递归产生新线程，每一个父线程产生两个子线程，接着父线程对两个子数组进行合并-Multi-thread two hours sorting method, recursive generate a new thread, each thread is a parent produces two sub-threads, then the parent thread to merge the two sub-arrays

实现B-树的创建、插入、删除、遍历等功能，并以层序方式通过程序台显示输出。-B-tree to achieve the creation, insertion, deletion, traversal functions, and to sequence through the procedure showed that the output of Taiwan.

数据结构算法，稀疏矩阵的存储，两矩阵相乘，两矩阵相加的实现-data structure algorithms, sparse matrix storage, two matrix multiplication, the sum of two matrix to achieve