4 ms·

Definitely more. There are lots of things that might be more optimal in terms of raw complexity but end up having abysmal performance due to things like cache l

• xdavidliu 3y ago
  for example, matrix multiplication has all sorts of algorithms with exponent significantly less than 3, but they are nearly all curiosities. In practice, the straightforward N^3 algo is used nearly everywhere
  • dekhn 3y ago
    I had a long discussion with Rob Pike once that ended with me saying "you know, I don't think people actually use Strassen on supercomputers" (we were discussing how somebody had managed to show an N*2.37 algorithm or something like that and "it was a new world's record").
    • xdavidliu 3y ago
      nit: ^, not *. ** for Python, but never *
      • dekhn 3y ago
        Unfortunately Hacker News editor converts double-asterisk to single which is what caused the problem. I never use ^ for "to the power of" due to its use in C for bitwise OR.