"introspective sort" meaning in English

{
  "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": "other",
          "name": "Entries with translation boxes",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with German translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Turkish translations",
          "parents": [],
          "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",
        "Entries with translation boxes",
        "Pages with 1 entry",
        "Pages with entries",
        "Terms with German translations",
        "Terms with Turkish translations",
        "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"
}