Editing Bucket sort (section)

===Histogram sort===
Another variant of bucket sort known as histogram sort or [[counting sort]] adds an initial pass that counts the number of elements that will fall into each bucket using a count array.<ref>[https://xlinux.nist.gov/dads/HTML/histogramSort.html NIST's Dictionary of Algorithms and Data Structures: histogram sort]</ref> Using this information, the array values can be arranged into a sequence of buckets in-place by a sequence of exchanges, leaving no space overhead for bucket storage.{{Failed verification|date=September 2020}}