查找、排序的应用实验1)　　顺序查找；

2)　　分别使用直接插入排序、冒泡排序、快速排序对原纪录序列进行排序，并显示排序结果；

3)　　对上述纪录列表排好序，然后对其进行折半查找；

4)　　利用原纪录序列建立一颗二叉排序树，并在其上实现特定关键字值结点的查找；

5)　　按照“除留余数法”哈希构造函数和线性探测再散列的冲突处理方法创建表长为m=11的哈希表；

6)　　实现5）创建哈希表上的查找。

-Find, Sequencing Experiment 1) sequential search　2), respectively, using the direct insertion sort, bubble sort, quick sort to sort the original sequence record, and display the sorting results　3) the record of the list sorted, then its the binary search　4) the use of the original record to establish a sequence of binary sort tree, and in its values to achieve a specific keyword search nodes　5) in accordance with the " except to stay more than the number of Law"　and the linear probing hash constructor, then conflict management methods to create the hash table length m = 11 in the hash table　6) to achieve 5) Create a hash table lookup.