[erlang-questions] **NEW** Now we are talking about!!! RESUME Pytagoriam Numbers

Toby Thain toby@REDACTED
Tue Nov 16 03:17:56 CET 2010


On 15/11/10 8:20 PM, Richard O'Keefe wrote:
> 
> On 16/11/2010, at 6:35 AM, Toby Thain wrote:
>>
>> Benchmarking a single problem size doesn't expose the differing time
>> complexity of the solutions (pace ROK).
> 
> Why "pace"?  I agree 100%.  That's why I was talking about O(N**2)
> vs O(N**3). 

I should have said "per". There isn't a language in which I can't make a
malapropism. :)

--Toby

> 
> 
> ________________________________________________________________
> erlang-questions (at) erlang.org mailing list.
> See http://www.erlang.org/faq.html
> To unsubscribe; mailto:erlang-questions-unsubscribe@REDACTED
> 
> 



More information about the erlang-questions mailing list