# Today I Learned

Some of the things I've learned every day since Oct 10, 2016

## 124: Skip List Search Algorithm

The following is an informal description of the algorithm for searching for an element in a skip list:

If you look the shape of the nodes that the algorithm visits on a given example, the general case of the search time being $O(\log{} n)$ makes intuitive sense.