@Gilles Hello Gilles. In this answer, you moved all comments to a chat. But I think some of them suggested improvements for the answer (This is a valid purpose for comments). Could you un-delete comments which point out issues of the answer, or post a summary comment of opinions?
Strictly speaking, $O(f(n))$ is a set of functions. So the value of $O(f(n))$ is simply the set of all functions that grow asymptotically not faster than $f(n)$. The notation $T(n) = O(f(n))$ is just a simplified way to write that $T(n) \in O(f(n))$.
Note that this also clarifies some issues of...
Knuth's original attribute grammar paper (title: Semantics of Context-Free Languages) introduced three types of circularity. More specifically section "Testing for circularity" page 134-5 figures 3.1-3. I am wondering if it's possible someone would explain in simple terms the three types of circu...
The tags graphs and graph-theory seem to cover much of the same ground.
Should we merge them?
