Proxmap sort

Proxmap sort is a specialized sorting algorithm designed to efficiently sort collections of objects that are represented as "proximity maps" or "proximity data." The specifics of the algorithm can vary, but the central idea revolves around the use of proximity information to achieve faster sorting performance than traditional comparison-based sorting methods. Proximity data typically involve relationships or distances between elements, which can be leveraged to reduce the number of comparisons needed during the sorting process.