"introspective sort" meaning in English

See introspective sort in All languages combined, or Wiktionary

Noun

Forms: introspective sorts [plural]
Head templates: {{en-noun}} introspective sort (plural introspective sorts)
  1. (computing) A sorting algorithm that begins with quicksort and switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted. Wikipedia link: introspective sort Categories (topical): Computing Synonyms: introsort Translations (Translations): Introsort [masculine] (German), içgözlemle sıralama (Turkish)
    Sense id: en-introspective_sort-en-noun-8mAZe1CD Categories (other): English entries with incorrect language header Topics: computing, engineering, mathematics, natural-sciences, physical-sciences, sciences

Inflected forms

Download JSON data for introspective sort meaning in English (1.6kB)

{
  "forms": [
    {
      "form": "introspective sorts",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "introspective sort (plural introspective sorts)",
      "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": "Computing",
          "orig": "en:Computing",
          "parents": [
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A sorting algorithm that begins with quicksort and switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted."
      ],
      "id": "en-introspective_sort-en-noun-8mAZe1CD",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "quicksort",
          "quicksort"
        ],
        [
          "heapsort",
          "heapsort"
        ]
      ],
      "raw_glosses": [
        "(computing) A sorting algorithm that begins with quicksort and switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted."
      ],
      "synonyms": [
        {
          "word": "introsort"
        }
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "translations": [
        {
          "code": "de",
          "lang": "German",
          "sense": "Translations",
          "tags": [
            "masculine"
          ],
          "word": "Introsort"
        },
        {
          "code": "tr",
          "lang": "Turkish",
          "sense": "Translations",
          "word": "içgözlemle sıralama"
        }
      ],
      "wikipedia": [
        "introspective sort"
      ]
    }
  ],
  "word": "introspective sort"
}
{
  "forms": [
    {
      "form": "introspective sorts",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "introspective sort (plural introspective sorts)",
      "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",
        "Translation table header lacks gloss",
        "en:Computing"
      ],
      "glosses": [
        "A sorting algorithm that begins with quicksort and switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "quicksort",
          "quicksort"
        ],
        [
          "heapsort",
          "heapsort"
        ]
      ],
      "raw_glosses": [
        "(computing) A sorting algorithm that begins with quicksort and switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted."
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "introspective sort"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "introsort"
    }
  ],
  "translations": [
    {
      "code": "de",
      "lang": "German",
      "sense": "Translations",
      "tags": [
        "masculine"
      ],
      "word": "Introsort"
    },
    {
      "code": "tr",
      "lang": "Turkish",
      "sense": "Translations",
      "word": "içgözlemle sıralama"
    }
  ],
  "word": "introspective sort"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-05 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.