Double Hashing Sort Algorithm
Yasser M. K. Omar, Hoda Osama, Amr Ahmed Badr · Computing in Science & Engineering · 2017
In the past few years, researchers have introduced several sorting algorithms to enhance time complexity, space complexity, and stability. A double hashing methodology first collects statistics about element distribution and then maps between elements of the array and indexes based on the knowledge collected during the first hashing.