I understand that. Still big-O is used as a speed estimate and Quicksort
is one of the best sorts. The video is misleading. /Erling
Den 2017-10-27 kl. 10:59, skrev Raul Miller:
Not exactly - big-O notation is not about speed, it's about shape of
the resource consumption curve.
If one algorithm consistently is 1000x slower than another, for all
choices of data, they would both have the same big-O structure.
It's important to understand these things when discussing them.
Thanks,
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
