Name for this sorting algorithm

algorithms terminology sorting

This algorithm is essentially counting sort

https://en.m.wikipedia.org/wiki/Counting_sort?fbclid=IwAR1XKmg3EuxUBqJOfTm4HTo8YuOXgP_ZDHy6qIBDR_4cTUqr70DTeT9wiRw

This algorithm can be computed in a single step when there is a diagonal symmetry in the Ferrer diagram

E.g permutations of 5,3,2,1,1

Or permutations of 4,3,2,1

Related

Charming approximation of $\pi$: $2\left(\frac{1}{2}\right)^{\phi/2}+2< \pi$, where $\phi$ is the golden ratio
A curious infinite product of factorials
Deriving a formula for the amount of time you should study for multiple tests
How can I determine which named property (or properties) are filling my exchange 2007 information store?
Finding $f$ such that $ \int f = \sum f$
Very simple dice game
Multicasting for WDS
Fractional Part Double Summations
Offline Address Book not updating for 1 user after adding Exchange 2010 to our environment
Distributed redundant storage solution?
How to prove this inequality in Euclidean space?
Galois closure of a $p$-extension is also a $p$-extension