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, -- Raul On Fri, Oct 27, 2017 at 3:27 AM, Erling Hellenäs <[email protected]> wrote: > As we can see here, Quicksort is on average as fast as any other sort: > > https://en.wikipedia.org/wiki/Sorting_algorithm#Comparison_of_algorithms > > However, since it is not stable it is not useful in APL and J. > > A "stable" sort does not reorder items of equal value. > > /Erling > > Den 2017-10-26 kl. 22:42, skrev Raul Miller: >> >> Here is a demonstration of a comparison of some relatively fast >> sorting algorithms: >> >> https://i.imgur.com/rWFaMvP.gifv >> >> This is from https://imgur.com/gallery/voutF which is worth reading. >> (Captions and descriptions are underneath the graphics they describe.) >> >> Some here might be interested... >> >> FYI, >> > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
