1 definition by Advanced Programmer
"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.
"Nope. Got it in O(n log(log n))."
Elaine bested Donald Knuth at Big O Notation. So she left.
by Advanced Programmer April 23, 2009