{
  "translations" :{
    "en": {
      "sc1": "Consider a graph of cost over all inputs of a given size $n$ for some algorithm for a given problem.",
      "sc2": "<br><br>The worst case for this algorithm is represented by this red point.",
      "sc3": "Define $A$ to be the collection of all algorithms that solve the problem. (Theoretically, there are an infinite number of such algorithms.)",
      "sc4": "<br>The graphs of the cost over all inputs of a given size $n$ will look like the following. (We are only showing the graphs of 4 algorithms here.)",
      "sc5": "The worst case lower bound is the least of all the highest points on all the graphs. (The circled point)",
      "lab1": "Input of Size $n$",
      "lab2": "Cost",
      "lab3": "Worst Case Input",
      "lab4": "Worst Case Cost"
    }
  }
}