Description: 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.
To Search:
File list (Check if you may need any files):
新建 文本文档.txt
Download