"skip list" meaning in All languages combined

{
  "forms": [
    {
      "form": "skip lists",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "skip list (plural skip lists)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2021, Neeraj Kumar, Arzoo Miglani, Probabilistic Data Structures for Blockchain-Based Internet of Things Applications, CRC Press, page 187",
          "text": "Skip list follows a linked list alike structure. However, the worst case time complexity for a search operation in linked list in O(n) as the list is linearly traversed while searching whereas for a skip list it is O(#x5C;logn).",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A probabilistic 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."
      ],
      "id": "en-skip_list-en-noun-Koj6C1MU",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "probabilistic",
          "probabilistic"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "fast",
          "fast"
        ],
        [
          "search",
          "search"
        ],
        [
          "ordered",
          "ordered"
        ],
        [
          "sequence",
          "sequence"
        ],
        [
          "element",
          "element"
        ],
        [
          "hierarchy",
          "hierarchy"
        ],
        [
          "subsequence",
          "subsequence"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A probabilistic 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."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "skip list"
      ]
    }
  ],
  "word": "skip list"
}

{
  "forms": [
    {
      "form": "skip lists",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "skip list (plural skip lists)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with quotations",
        "en:Theory of computing"
      ],
      "examples": [
        {
          "ref": "2021, Neeraj Kumar, Arzoo Miglani, Probabilistic Data Structures for Blockchain-Based Internet of Things Applications, CRC Press, page 187",
          "text": "Skip list follows a linked list alike structure. However, the worst case time complexity for a search operation in linked list in O(n) as the list is linearly traversed while searching whereas for a skip list it is O(#x5C;logn).",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A probabilistic 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."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "probabilistic",
          "probabilistic"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "fast",
          "fast"
        ],
        [
          "search",
          "search"
        ],
        [
          "ordered",
          "ordered"
        ],
        [
          "sequence",
          "sequence"
        ],
        [
          "element",
          "element"
        ],
        [
          "hierarchy",
          "hierarchy"
        ],
        [
          "subsequence",
          "subsequence"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A probabilistic 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."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "skip list"
      ]
    }
  ],
  "word": "skip list"
}