I am reviewing BigO notation from this document: http://www.scs.ryerson.ca/~mth110/Handouts/PD/bigO.pdf
This document contains this information and the accompanying table:
In the following table we suppose that a linear algorithm can do a problem up to size 1000 in 1 second. We then use this to calculate how large a problem this algorithm could handle in 1 minute and 1 hour.
I can see where values such as $n^2$ come from, as it is getting the square root of 1000. However, I am at a loss as to how the author calculated $2^n$ and $n log(n)$. Could someone help determine how these values are calculated?