4 ms·

At first I didn't think I'd be interested. > Using some efficiency techniques, it is twice as fast as quicksort for large sets of strings.

• hinkley 3y ago
  I’m not calling it flag sort. It’s an in-place bucket sort which is interesting.
  • wodenokoto 3y ago
    From Wikipedia[1]: > The name American flag sort comes by analogy with the Dutch national flag problem[2] in the last step: efficiently partition the array into many "stripes". [1] https://en.m.wikipedia.org/wiki/American_flag_sort https://en.m.wikipedia.org/wiki/American_flag_sort [2] https://en.m.wikipedia.org/wiki/Dutch_national_flag_problem https://en.m.wikipedia.org/wiki/Dutch_national_flag_problem
    • hinkley 3y ago
      I read this rationale before I made my comment.
    • kleiba 3y ago
      > From Wikipedia[1]: ...or from the very article itself...
  • remram 3y ago
    Or in-place radix sort maybe. I agree with you, the name is ridiculous, reminds me of miracle sort or intelligent design sort: https://www.dangermouse.net/esoteric/intelligentdesignsort.html https://www.dangermouse.net/esoteric/intelligentdesignsort.h... Probably those two flag sort algorithms were named before the joke algorithms were popularily known.
• thefifthsetpin 3y ago
  Quicksort isn't great when comparing two items is expensive.