This article proposes a quick sort method based on the machine code of floating point numbers, which can sort the floating point numbers distributed at random.
本文提出一种可对任意分布的浮点数进行排序的快速排序方法，它基于浮点数的机内编码，具有速度快、实现简单、实用的特点。
The method is not only obviously quicker than that of quick sort, but also much quicker than the bucket sorting method, even in the case of non-uniformly distributed data.
该排序方法不仅在速度上明显快于快速排序法，而且在非均匀分布数据的情况下也明显快于桶排序法。
But because the merging is difficult to do in place, generally, it has higher memory requirements than in-place sort algorithms, such as quick-sort.
但是由于很难在原地进行合并，所以合并排序的内存需求比能够原地进行的排序算法(例如快速排序)更高。
But because the merging is difficult to do in place, generally, it has higher memory requirements than in-place sort algorithms, such as quick-sort.
但是由于很难在原地进行合并，所以合并排序的内存需求比能够原地进行的排序算法(例如快速排序)更高。
应用推荐