On 4 Okt, 20: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
In message , Edward A. Falk wrote:
> In article ,
> Roy Smith wrote:
>
>>Google for "Big-O notation". Depending on your level of interest,
>>expect to spend anywhere from an hour to the next four years reading
>>what pops out :-)
>
> Yeah, that's my problem with Wikipedia too.
Which part of “
In article ,
Roy Smith wrote:
>In article ,
> Tobiah wrote:
>
>Google for "Big-O notation". Depending on your level of interest,
>expect to spend anywhere from an hour to the next four years reading
>what pops out :-)
Yeah, that's my problem with Wikipedia too. Plus, they like to just
roll
In article ,
Tobiah wrote:
> Don't do it that way, it will result in O(n**2)!
> [...]
> 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.
Google for "Big-O notation". Depending on your leve
On 2010-10-04, MRAB wrote:
> 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
> On Tue, Oct 5, 2010 at 12:08 AM, 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 t
Or the complexity of an algorithm.
2010/10/4 MRAB
> 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
Here you are:
http://en.wikipedia.org/wiki/Big_O_notation
Best regards,
Matteo
On Mon, Oct 4, 2010 at 8:38 PM, 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)!
this might help:
http://en.wikipedia.org/wiki/Analysis_of_algorithms
On Tue, Oct 5, 2010 at 12:08 AM, 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 so
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 n
On Oct 4, 12:38 pm, 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 squ
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
12 matches
Mail list logo
