Re: How slow is O(n^2) ?

From: Herbert Glarner <herbert.glarner@xxxxxxxxxx>
Date: Thu, 13 Jul 2006 17:57:13 +0200

knguyen wrote:

Can anyone give a rough idea of how slow would an O(n^2) algorithm do
on an input of 100.000 items ?

I'm not sure if you refer to the big O notation itself or to the particular value n^2.

This explains the notation pretty well and also has an ordered list with the common notations: http://en.wikipedia.org/wiki/Big_O_notation

Regards
//Herbert

--
http://herbert.wikispaces.com
.

References:
- How slow is O(n^2) ?
  - From: knguyen

Prev by Date: Travelling Salesman Relaxation
Next by Date: Re: Travelling Salesman Relaxation
Previous by thread: Re: How slow is O(n^2) ?
Next by thread: Military logistic problem
Index(es):
- Date
- Thread