• computeMSP(Graph<L> g) → $O(E\space logE)$

  • quickSort() → $O(n^2)$
  • weightCheck() → $\Theta(n^2)$