In computer science, a skip list is a data structure that allows ${\\displaystyle {\\mathcal {O}}(\\log n)}$ search complexity as well as ${\\displaystyle {\\mathcal {O}}(\\log n)}$ insertion complexity within an ordered sequence of ${\\displaystyle n}$ elements. Thus it can get the best features of an array (for searching) while maintaining a linked list-like structure that allows insertion- which is not possible in an array. Fast search is made possible by maintaining a linked hierarchy of subsequences, with each successive subsequence skipping over fewer elements than the previous one (see the picture below on the right). Searching starts in the sparsest subsequence until two consecutive elements have been found, one smaller and one larger than or equal to the element searched for. Via the linked hierarchy, these two elements link to elements of the next sparsest subsequence, where searching is continued until finally we are searching in the full sequence. The elements that are skipped over may be chosen probabilistically or deterministically, with the former being more common.