高级数据结构dictionary.pptVIP

Dictionaries Collection of items. Each item is a pair. (key, element) Pairs have different keys. Application Collection of student records in this class. (key, element) = (student name, linear list of assignment and exam scores) All keys are distinct. Dictionary With Duplicates Keys are not required to be distinct. Word dictionary. Pairs are of the form (word, meaning). May have two or more entries for the same word. (bolt, a threaded pin) (bolt, a crash of thunder) (bolt, to shoot forth suddenly) (bolt, a gulp) (bolt, a standard roll of cloth) etc. Dictionary Operations Static Dictionary. initialize/create get(theKey) (a.k.a. search) CD ROM word dictionary CD ROM geographic database of cities, rivers, roads, auto navigation system, etc. Dynamic Dictionary. get(theKey) (a.k.a. search) put(theKey, theElement) (a.k.a. insert) remove(theKey) (a.k.a. delete) Hash Table Dictionaries O(1) expected time for get, put, and remove. O(n) worst-case time for get, put, and remove. O(log n) if overflows handled by balanced search trees. Not suitable for nearest match queries. Get element with smallest key = theKey. Not suitable for indexed operations. Get element with third smallest key. Remove element with 5th smallest key. Bin Packing n items to be packed into bins each item has a size each bin has a capacity of c minimize number of bins Bin Packing Heuristics Best Fit. Items are packed one at a time in given order. To determine the bin for an item, first determine set S of bins into which the item fits. If S is empty, then start a new bin and put item into this new bin. Otherwise, pack into bin of S that has least available capacity. Best Fit Example n = 4 weights = [4, 7, 3, 6] capacity = 10 Best Fit n = 4 weights = [4, 7, 3, 6] capacity = 10 Best Fit n = 4 weights = [4, 7, 3, 6] capacity = 10 Best Fit n = 4 weights = [4, 7, 3, 6] capacity = 10 Best Fit n = 4 weights = [4, 7, 3, 6] capacity = 10 Best Fit n = 4 weights = [4, 7, 3, 6] capacity = 10 Implementation Of Best Fit U