The problem with O(n^2) algorithms is that they are fast enough to get into prod...

		bsder 68 days ago \| parent \| context \| favorite \| on: Rob Pike’s Rules of Programming (1989) The problem with O(n^2) algorithms is that they are fast enough to get into production and slow enough to explode in production.