Hi, I created a sorting algorithm that is faster than ShellSort when the range of values is smaller than the number of elements. I think it is a simple algorithm, placing all the values in an object, finding min and max while doing so. Afterwards it simply checks every value in the object between min and max. I'm not sure where to share it, and I'm also open to someone telling me it already exists.So, feedback please, and if it is new, where should I share it?
https://github.com/Frazer/hashSort