A notation used to denote the run-time of a given algorithm.
"So our lower bound here is O(n log n)."
"Nope. Got it in O(n log(log n))."
Elaine bested Donald Knuth at Big O Notation. So she left.
Free Daily Email
Emails are sent from firstname.lastname@example.org. We'll never spam you.