第03章 跳跃表Skip Lists.pptVIP

Skip Lists Skip Lists Skip Lists Outline and Reading What is a skip list (§3.5) Operations Search (§3.5.1) Insertion (§3.5.2) Deletion (§3.5.2) Implementation Analysis (§3.5.3) Space usage Search and update times Comparison of dictionary implementations What is a Skip List A skip list for a set S of distinct (key, element) items is a series of lists S0, S1 , … , Sh such that Each list Si contains the special keys +? and -? List S0 contains the keys of S in nondecreasing order Each list is a subsequence of the previous one, i.e., S0 ? S1 ? … ? Sh List Sh contains only the two special keys We show how to use a skip list to implement the dictionary ADT Search We search for a key x in a a skip list as follows: We start at the first position of the top list At the current position p, we compare x with y ? key(after(p)) x = y: we return element(after(p)) x y: we “scan forward” x y: we “drop down” If we try to drop down past the bottom list, we return NO_SUCH_KEY Example: search for 78 Randomized Algorithms A randomized algorithm performs coin tosses (i.e., uses random bits) to control its execution It contains statements of the type b ? random() if b = 0 do A … else { b = 1} do B … Its running time depends on the outcomes of the coin tosses We analyze the expected running time of a randomized algorithm under the following assumptions the coins are unbiased, and the coin tosses are independent The worst-case running time of a randomized algorithm is often large but has very low probability (e.g., it occurs when all the coin tosses give “heads”) We use a randomized algorithm to insert items into a skip list Insertion To insert an item (x, o) into a skip list, we use a randomized algorithm: We repeatedly toss a coin until we get tails, and we denote with i the number of times the coin came up heads If i ? h, we add to the skip list new lists Sh+1, … , Si +1, each containing only the two special keys We search for x in the skip list and find the p