Often, we can express the running time of an algorithm as a composition of other functions. We might also look at other relationships. Here are some questions we might ask ourselves about composition of functions. We might also ask more general questions about big-O notation. There are a number of concepts like big-O notation.
Omega provides a lower bound on the running time of an algorithm.
Theta notation gives a more precise running time, as it provides both a lower and upper bound on the running time. Some computer scientists look at even more abstract issues, such as the minimum running time for any algorithm that solves a particular type of problem. We'll spend much of today's class on an algorithm analysis lab . Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.