3 ms·

we're talking about asymptotics (i.e. the exponent). Things like "1/10 the time" are utterly meaningless here.

• CyberDildonics 3y ago
  Who is talking about that? They said 'faster' not less algorithmic complexity. 1/10th the time is much faster.
  • graycat 3y ago
    > 1/10th the time is much faster. No, absolutely no, it's not in any meaningful or useful sense "faster" as in which algorithm is "faster". You utterly fail to get this point.
    • CyberDildonics 3y ago
      If something runs in less time, it's faster. If something runs in 1/10th the time as something else it is multiple orders of magnitude faster. I don't think I've ever seen someone try to redefine 'faster' before. You keep trying to equate naive algorithmic complexity and speed, but you haven't even linked anything that shows heapsort is better than other sorts like quicksort at that. You haven't actually linked anything to back up any of what you're saying, even the irrelevant offtopic claims.