归并排序、桶排序.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Searching： Search in ID[] to determine the possible sublist. ( Sequential search or binary search can be used.) Search in ID[k]. ( Only sequential search can be used.) Indexing Search 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 22 12 13 8 9 20 33 42 44 38 24 48 60 58 74 57 86 53 22 48 86 1 7 13 Index table Search k=38 ASL=ASLIndexing table +ASLSublist For search list of length n, it is divided into b sublist and the length of a sublist is s = n/b if using binary search in indexing table, the average search length will be if using sequential search in indexing table, the average search length will be Search Analysis For list of length 10000, Sequential search: ASL=(n+1)/2=5000 Indexing search: ASL= log2(b+1)-1+ (S+1) /2 57 or ASL= (b+1)/2+ (S+1)/2 = 101 Binary search: ASL=log2(n+1)-1 14 Search Analysis Sequential Search Binary Search Indexing Searching ASL Largest Smallest Middle List Structure Ordered 、Unordered Ordered ordered indexing table Storage Structure Array、Linked List Array Array、Linked List Searching comparison Outline Search Table Sequential Search Binary Search Indexing Search Binary Search Trees Binary search tree AVL tree B- Tree Hash Table What is hashing Hash Function Collision Resolution Open Addressing Rehashing Separate Chaining Analysis of Hashing Why B- Tree Goals of Indexing Store large files Support multiple search keys Support efficient insert, delete, and range queries Difficulties when storing tree index on disk: Tree must be balanced. Each path from root to leaf should cover few disk pages The B-Tree is now the standard file organization for applications requiring insertion, deletion, and key range searches. B-Tree Definition (多路查找树) A B-Tree of order m has these properties The root is either a leaf or has at least tw