Also, just take a look at some examples of lower bounds on a problem. Even the simplest one I know (sorting): http://www.cs.colorado.edu/~karl/2270.spring03/s

Also, just take a look at some examples of lower bounds on a problem. Even the simplest one I know (sorting): http://www.cs.colorado.edu/~karl/2270.spring03/sorting.html http://www.cs.colorado.edu/~karl/2270.spring03/sorting.html is much tougher than showing the running time of an algorithm.