= Skip List =

A more specialized version of a list with log(n) search, insertion, and
deletion (on average).

== Good For ==

* Keeping an order with fast lookups and removals

== Bad For ==

* Space constrained enviroments (nlogn space usage)

== Notes ==

Honestly things like a B-Tree are better alternatives, but sometimes you need a
list like this. 


[[algorithms]]