归并排序、桶排序.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