That interesting notation used to describe how long a loop will take.

[Felipe Bastos Nunes]

Or the complexity of an algorithm.

2010/10/4 MRAB <python at mrabarnett.plus.com>

> On 04/10/2010 19:38, Tobiah 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.
>>
>>  It's called the "Big O notation".
>
> --
> http://mail.python.org/mailman/listinfo/python-list
>



-- 
Felipe Bastos Nunes
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/python-list/attachments/20101004/2c296b09/attachment-0001.html>