American flag sort is an efficient variant of radix sort that categorizes items into buckets. It counts the number of items in each bucket, determines their starting position in the array, and strategically rearranges items. The method is named after the Dutch national flag problem and is ideal for sorting bytes in 256 buckets. It outperforms quicksort by being twice as fast for large string sets and works without a collection step. Developed by PEB, it was detailed in the McIlroy, Bostic, and McIlroy paper. This technique is a clever approach to sorting algorithms and shows promising results for efficient data organization.
https://xlinux.nist.gov/dads/HTML/americanFlagSort.html