{
  "tag": "2YCV99",
  "kind": "concept",
  "slug": "order-of-growth",
  "name": "Order of growth",
  "aliases": [
    "growth rate"
  ],
  "area": "foundations/asymptotic-analysis",
  "level": "intro",
  "summary": "The Θ-class of a running-time function, found from its dominant term, which tells how the cost scales as the input size grows.",
  "prereqs": [
    "time-complexity",
    "asymptotic-notation"
  ],
  "sources": [
    {
      "book": "isbn:9780262046305",
      "title": "Cormen, Leiserson, Rivest and Stein, Introduction to Algorithms, fourth edition",
      "locator": "Chapter 3"
    },
    {
      "book": "isbn:9780321573513",
      "title": "Robert Sedgewick and Kevin Wayne, Algorithms, fourth edition",
      "locator": "Section 1.4"
    },
    {
      "book": "isbn:9780201896831",
      "title": "Donald E. Knuth, The Art of Computer Programming, Volume 1, third edition",
      "locator": "Section 1.2.11.1"
    }
  ],
  "see_also": [
    "common-growth-rates",
    "doubling-hypothesis",
    "comparing-growth-by-limits",
    "tilde-notation",
    "logarithms",
    "constant-time",
    "linear-time",
    "quadratic-time"
  ],
  "url": "https://algorithm.tamnd.com/order-of-growth/",
  "path": "nodes/foundations/asymptotic-analysis/order-of-growth",
  "status": {
    "slug": "order-of-growth",
    "h": {
      "level": 0,
      "max": 3,
      "label": "H0",
      "name": "no proof",
      "next": [
        "add a proof in proofs/ (06.5)"
      ]
    },
    "l": {
      "level": 0,
      "max": 4,
      "label": "L0",
      "name": "no Lean part",
      "next": [
        "name a Lean module in the lean field (07)"
      ]
    },
    "i": {},
    "v": {
      "level": 0,
      "max": 3,
      "label": "V0",
      "name": "none",
      "next": [
        "add viz/scene.ts or a figure (10)"
      ]
    },
    "w": {
      "level": 4,
      "max": 5,
      "label": "W4",
      "name": "complete",
      "next": [
        "a review of the text: no review record reviews/2YCV99/text.yaml"
      ]
    }
  },
  "scene": false
}