A skip list is a data structure for storing a sorted list of items using a hierarchy of linked lists that connect increasingly sparse subsequences of the items. These auxiliary lists allow item lookup with efficiency comparable to balanced binary search trees (that is, with number of probes proportional to log n instead of n).
Each link of the sparser lists skips over many items of the full list in one step, hence the structure's name. These forward links may be added in a randomized way with a geometric / negative binomial distribution. Insert, search and delete operations are performed in logarithmic expected time. The links may also be added in a non-probabilistic way so as to guarantee amortized (rather than merely expected) logarithmic cost.
Read more about Skip List: Description, History, Usages
Famous quotes containing the words skip and/or list:
“We are playing with fire when we skip the years of three, four, and five to hurry children into being age six.... Every child has a right to his fifth year of life, his fourth year, his third year. He has a right to live each year with joy and self-fulfillment. No one should ever claim the power to make a child mortgage his today for the sake of tomorrow.”
—James L. Hymes, Jr. (20th century)
“I made a list of things I have
to remember and a list
of things I want to forget,
but I see they are the same list.”
—Linda Pastan (b. 1932)