> you're railing against a non-issue with an absurdly complicated argument. It's not really the correct kind of argument. Landau notation is for analyzing asym

> you're railing against a non-issue with an absurdly complicated argument. It's not really the correct kind of argument. Landau notation is for analyzing asymptotic behaviour of functions; this makes them fit as sets of functions for many purposes in theoretical compsi, but it's simply the wrong approach for practical, "in the field" comparison of implemented algorithms. It only has some merit there to state... well, asymptotic behaviour, like the complexity of a hash-table lookup or deleting an arbitrary element of a vector.