Optimisation by killing O(n^2) algorithms
Monday, May 29th, 2006Sometimes optimising means shaving milliseconds after spending lots of time on subtle algorithms… And sometimes it just means discovering huge counter-performant parts in your fast mail user agent. The advantage of the latter is that, for similar amounts of work, you get much more results.
O(n^2) algorithms are algorithms which execution time is proportional to the [...]