flag as inappropriate

Create your own!

      "And who can tell me what the computational complexity of this algorithm is?" asks Ms. Smith. "It's O(n^2)!" shouts the collar-popped douchebro in the back.
Barbie rolls her eyes. "It's O(n log n)."