proxmap sortとは 意味・読み方・使い方

ProxmapSort, or Proxmap sort, is a sorting algorithm that works by partitioning an array of data items, or keys, into a number of "subarrays" (termed buckets, in similar sorts). The name is short for computing a "proximity map," which indicates for each key K the beginning of a subarray in the where K will reside in the final sorted order. Keys are dropped into each subarray using insertion sort. If keys are "well distributed" amongst the subarrays, sorting occurs in O(n) time, much faster than comparison-based sorting, which can do no better than O(nlogn). The computational complexity estimates involve the number of subarrays and the proximity mapping function, the "map key," used. It is a form of bucket and radix sort. The algorithm scales up well as the number of data become large.