See Timsort in All languages combined, or Wiktionary
Download JSON data for Timsort meaning in English (1.7kB)
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "Tim",
"3": "sort"
},
"expansion": "Tim + sort",
"name": "compound"
}
],
"etymology_text": "Tim + sort, named after Tim Peters, who implemented it in 2002 for the Python programming language.",
"head_templates": [
{
"args": {},
"expansion": "Timsort",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "English entries with language name categories using raw markup",
"parents": [
"Entries with language name categories using raw markup",
"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"
}
],
"glosses": [
"A sorting algorithm derived from mergesort and insertion sort, designed to perform well on many kinds of real-world data."
],
"id": "en-Timsort-en-name-vBRCWQff",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"sort",
"sort"
],
[
"algorithm",
"algorithm"
],
[
"mergesort",
"mergesort"
],
[
"insertion sort",
"insertion sort"
],
[
"real-world",
"real-world"
],
[
"data",
"data"
]
],
"raw_glosses": [
"(computing theory) A sorting algorithm derived from mergesort and insertion sort, designed to perform well on many kinds of real-world data."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Timsort"
]
}
],
"word": "Timsort"
}
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "Tim",
"3": "sort"
},
"expansion": "Tim + sort",
"name": "compound"
}
],
"etymology_text": "Tim + sort, named after Tim Peters, who implemented it in 2002 for the Python programming language.",
"head_templates": [
{
"args": {},
"expansion": "Timsort",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English compound terms",
"English entries with incorrect language header",
"English entries with language name categories using raw markup",
"English eponyms",
"English lemmas",
"English proper nouns",
"English uncountable nouns",
"en:Theory of computing"
],
"glosses": [
"A sorting algorithm derived from mergesort and insertion sort, designed to perform well on many kinds of real-world data."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"sort",
"sort"
],
[
"algorithm",
"algorithm"
],
[
"mergesort",
"mergesort"
],
[
"insertion sort",
"insertion sort"
],
[
"real-world",
"real-world"
],
[
"data",
"data"
]
],
"raw_glosses": [
"(computing theory) A sorting algorithm derived from mergesort and insertion sort, designed to perform well on many kinds of real-world data."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Timsort"
]
}
],
"word": "Timsort"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-18 from the enwiktionary dump dated 2024-05-02 using wiktextract (1d5a7d1 and 304864d). 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.