"big O notation" meaning in All languages combined

See big O notation on Wiktionary

Noun [English]

Audio: LL-Q1860 (eng)-Flame, not lame-big O notation.wav
Etymology: From the capital letter O (short for order, originally German Ordnung) used in the notation. Etymology templates: {{der|en|de|Ordnung}} German Ordnung Head templates: {{en-noun|-|head=big O notation}} big O notation (uncountable)
  1. (mathematics, computing theory) A particular notation, useful in the analysis of algorithms, which describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions. Tags: uncountable Related terms: time complexity
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "de",
        "3": "Ordnung"
      },
      "expansion": "German Ordnung",
      "name": "der"
    }
  ],
  "etymology_text": "From the capital letter O (short for order, originally German Ordnung) used in the notation.",
  "head_templates": [
    {
      "args": {
        "1": "-",
        "head": "big O notation"
      },
      "expansion": "big O notation (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [],
          "source": "w"
        }
      ],
      "glosses": [
        "A particular notation, useful in the analysis of algorithms, which describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions."
      ],
      "id": "en-big_O_notation-en-noun-4B~iPpca",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "notation",
          "notation"
        ],
        [
          "analysis",
          "analysis"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "limiting",
          "limiting"
        ],
        [
          "function",
          "function"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computing theory) A particular notation, useful in the analysis of algorithms, which describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions."
      ],
      "related": [
        {
          "word": "time complexity"
        }
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "audio": "LL-Q1860 (eng)-Flame, not lame-big O notation.wav",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/0/07/LL-Q1860_%28eng%29-Flame%2C_not_lame-big_O_notation.wav/LL-Q1860_%28eng%29-Flame%2C_not_lame-big_O_notation.wav.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/0/07/LL-Q1860_%28eng%29-Flame%2C_not_lame-big_O_notation.wav/LL-Q1860_%28eng%29-Flame%2C_not_lame-big_O_notation.wav.ogg"
    }
  ],
  "word": "big O notation"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "de",
        "3": "Ordnung"
      },
      "expansion": "German Ordnung",
      "name": "der"
    }
  ],
  "etymology_text": "From the capital letter O (short for order, originally German Ordnung) used in the notation.",
  "head_templates": [
    {
      "args": {
        "1": "-",
        "head": "big O notation"
      },
      "expansion": "big O notation (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "time complexity"
    }
  ],
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms derived from German",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Mathematics",
        "en:Theory of computing"
      ],
      "glosses": [
        "A particular notation, useful in the analysis of algorithms, which describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "notation",
          "notation"
        ],
        [
          "analysis",
          "analysis"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "limiting",
          "limiting"
        ],
        [
          "function",
          "function"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computing theory) A particular notation, useful in the analysis of algorithms, which describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "audio": "LL-Q1860 (eng)-Flame, not lame-big O notation.wav",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/0/07/LL-Q1860_%28eng%29-Flame%2C_not_lame-big_O_notation.wav/LL-Q1860_%28eng%29-Flame%2C_not_lame-big_O_notation.wav.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/0/07/LL-Q1860_%28eng%29-Flame%2C_not_lame-big_O_notation.wav/LL-Q1860_%28eng%29-Flame%2C_not_lame-big_O_notation.wav.ogg"
    }
  ],
  "word": "big O notation"
}

Download raw JSONL data for big O notation meaning in All languages combined (2.1kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-05-27 from the enwiktionary dump dated 2025-05-20 using wiktextract (a4e883e and f1c2b61). 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.