Randomized algorithms: On the improvement of searching techniques using probabilistic linear linked skip lists

Abstract

This paper explores a concept of randomized algorithms [6] combined with linked skip list. A skip list is a probabilistic data structure where elements are kept sorted by key. It allows quick search, insertions and deletions of elements with simple algorithms. It is basically a linked list with additional pointers such that intermediate nodes can be skipped. It uses a random number generator to make some decisions. Skip Lists are used as an alternative to balanced trees. A skip list is a practical data structure that gives good results while keeping the implementation simple. © 2013 Springer.