"big O notation" meaning in English

See big O notation in All languages combined, or Wiktionary

Noun

Etymology: From the capital letter O (short for order) used in the notation. Etymology templates: {{m|en|order}} order 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 Categories (topical): Mathematics, Theory of computing Related terms: time complexity

Download JSON data for big O notation meaning in English (1.9kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "order"
      },
      "expansion": "order",
      "name": "m"
    }
  ],
  "etymology_text": "From the capital letter O (short for order) 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": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "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 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"
      ]
    }
  ],
  "word": "big O notation"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "order"
      },
      "expansion": "order",
      "name": "m"
    }
  ],
  "etymology_text": "From the capital letter O (short for order) 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 uncountable nouns",
        "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"
      ]
    }
  ],
  "word": "big O notation"
}

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.