"constant time" meaning in English

{
  "forms": [
    {
      "form": "constant times",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "constant time (countable and uncountable, plural constant times)",
      "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 Czech translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "Coordinate term: amortized constant time"
        }
      ],
      "glosses": [
        "An algorithm, also written as O(1) time) where the value of T(n) (the complexity of the algorithm) is bounded by a value that does not depend on the size of the input."
      ],
      "id": "en-constant_time-en-noun-~y~s5MYz",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "value",
          "value"
        ],
        [
          "bounded",
          "bounded"
        ],
        [
          "depend",
          "depend"
        ],
        [
          "size",
          "size"
        ],
        [
          "input",
          "input"
        ]
      ],
      "raw_glosses": [
        "(computer science) An algorithm, also written as O(1) time) where the value of T(n) (the complexity of the algorithm) is bounded by a value that does not depend on the size of the input."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "translations": [
        {
          "code": "cs",
          "lang": "Czech",
          "sense": "Translations",
          "tags": [
            "masculine"
          ],
          "word": "konstantní čas"
        }
      ]
    }
  ],
  "word": "constant time"
}

{
  "forms": [
    {
      "form": "constant times",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "constant time (countable and uncountable, plural constant times)",
      "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",
        "English uncountable nouns",
        "Entries with translation boxes",
        "Pages with 1 entry",
        "Pages with entries",
        "Terms with Czech translations",
        "Translation table header lacks gloss",
        "en:Computer science"
      ],
      "examples": [
        {
          "text": "Coordinate term: amortized constant time"
        }
      ],
      "glosses": [
        "An algorithm, also written as O(1) time) where the value of T(n) (the complexity of the algorithm) is bounded by a value that does not depend on the size of the input."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "value",
          "value"
        ],
        [
          "bounded",
          "bounded"
        ],
        [
          "depend",
          "depend"
        ],
        [
          "size",
          "size"
        ],
        [
          "input",
          "input"
        ]
      ],
      "raw_glosses": [
        "(computer science) An algorithm, also written as O(1) time) where the value of T(n) (the complexity of the algorithm) is bounded by a value that does not depend on the size of the input."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "translations": [
    {
      "code": "cs",
      "lang": "Czech",
      "sense": "Translations",
      "tags": [
        "masculine"
      ],
      "word": "konstantní čas"
    }
  ],
  "word": "constant time"
}