> On Tue, Oct 5, 2010 at 12:08 AM, Tobiah <t...@rcsreg.com> wrote: >> It gets used here frequently, but not >> having majored in programming, I'm not >> familiar with it. One might say: >> >> Don't do it that way, it will result in O(n**2)! >> >> Or something like that. I read this to mean >> that the execution time varies with the square >> of the number of iterations, or items being sorted >> etc.. >> >> I want to google this, but I'm not sure what >> keywords to use. Is there a wikipedia article about this >> subject? I imagine that it has a concise name.
On Mon, Oct 4, 2010 at 11:58 AM, Shashank Singh <shashank.sunny.si...@gmail.com> wrote: > this might help: > > http://en.wikipedia.org/wiki/Analysis_of_algorithms Additionally: http://en.wikipedia.org/wiki/Time_complexity Cheers, Chris -- http://mail.python.org/mailman/listinfo/python-list
