Re: How slow is O(n^2) ?
- From: David Kinny <dnk@xxxxxxxxxxxxxxxx>
- Date: Thu, 13 Jul 2006 04:17:17 GMT
In <1152760516.757732.313050@xxxxxxxxxxxxxxxxxxxxxxxxxxx> "knguyen" <nguyen.h.khanh@xxxxxxxxx> writes:
Hello,
Can anyone give a rough idea of how slow would an O(n^2) algorithm do
on an input of 100.000 items ?
About 100 times slower than on an input of 10.000 items.
All else being equal, that is.
Thanks
kn
You're welcome.
David
.
- References:
- How slow is O(n^2) ?
- From: knguyen
- How slow is O(n^2) ?
- Prev by Date: How slow is O(n^2) ?
- Next by Date: Re: Mapping rationals to binary strings while preserving order
- Previous by thread: How slow is O(n^2) ?
- Next by thread: Re: How slow is O(n^2) ?
- Index(es):
