bn:02722844n
Noun Concept
Categories: Articles with short description, Linked lists, Probabilistic data structures, Computer-related introductions in 1989
EN
skip list  jump list  skip lists  Skip search  skiplist
EN
In computer science, a skip list is a probabilistic data structure that allows O {\displaystyle O} average complexity for search as well as O {\displaystyle O} average complexity for insertion within an ordered sequence of n {\displaystyle n} elements. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a skip list is a probabilistic data structure that allows O {\displaystyle O} average complexity for search as well as O {\displaystyle O} average complexity for insertion within an ordered sequence of n {\displaystyle n} elements. Wikipedia
A probabilistic data structure Wikipedia Disambiguation
Data structure that allows fast search within an ordered sequence of elements Wikidata
A data structure that allows fast search within an ordered sequence of elements by maintaining a linked hierarchy of subsequences, with each successive subsequence skipping over fewer elements than the previous one. Wiktionary
IS A
DISCOVERER OR INVENTOR
Wikipedia
Wikidata
Wiktionary
Wikipedia Redirections
Wikidata Alias