{
  "translations" :{
    "en": {
	  "Slide 1": "Quicksort's worst case will occur when the pivot does a poor job of breaking the array, that is, when there are no records in one partition, and $n-1$ records in the other",
	  "Slide 2": "Let's start with an array of size $n$",
	  "Slide 3": "The pivot partitions the array into two parts one of size $0$ and the other of size $n-1$ ... This requires $n-1$ units of work",
	  "Slide 4": "For the $n-1$ partition, the pivot breaks it into two parts one of size $0$ and the other of size $n-2$ ... This requires $n-2$ units of work",
	  "Slide 5": "For the $n-2$ partition, the pivot breaks it into two parts one of size $0$ and the other of size $n-3$ ... This requires $n-3$ amount of work",
	  "Slide 6": "In the last level, the pivot breaks a partition of size $2$ into two parts one of size $0$ and the other of size $1$ ... This requires a single unit of work",
	  "Slide 7": "Thus, the total amount of work is determined by the summation $\\displaystyle\\sum_{i=1}^{n-1}i$",
	  "Slide 8": "Therefore, the worst case running time of Quicksort is $\\theta(n^2)$",
	  "lab1": "<b><u>Amount Of Work</b></u>"
    }
  }
}