See Also: DataStructures

Sound of Sorting http://panthema.net/2013/sound-of-sorting/

MIT OCW 6.042J Mathematics for Computer Science http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-fall-2010/

MIT OCW 6.006 Introduction to Algorithms http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/

MIT OCW 6.046 Design and Analysis of Algorithms http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2012/

http://stackoverflow.com/questions/2307283/what-does-olog-n-mean-exactly

http://stackoverflow.com/questions/487258/plain-english-explanation-of-big-o/487278#487278

http://en.wikipedia.org/wiki/Analysis_of_algorithms#Orders_of_growth "Computer A, running the linear search program, exhibits a linear growth rate. The program's run-time is directly proportional to its input size. Doubling the input size doubles the run time, quadrupling the input size quadruples the run-time, and so forth. On the other hand, Computer B, running the binary search program, exhibits **a logarithmic growth rate. Doubling the input size only increases the run time by a constant amount** (in this example, 50,000 ns)."

Graphing and Solving with WolframAlpha