1. A new practical "in-place" sorting algorithm, called super quick sort, is obtained by merging some characteristics of radix sort and quick sort.

2. 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.

3. To speed up computation, we use Quick Sort algorithm and Insertion Sort algorithm instead of usually used Heap Sort algorithm.

3.

4. Quick sort (Quicksort) is a bubble sort of an improvement.

5. Heapsort is a kind of quick sort algorithm, the minimum(or maximum) can be found by the greedy algorithm.

6. Based on the discussion of quick sort algorithm, a new algorithm, position computing, is proposed.

7. On the further research of quick sort algorithm and position computing algorithm, the latter one is improved and optimized, thus more effective in data processing.

8. It's proved by algorithm analysis and experimental results that the new sorting algorithm is better than the quick sort when data are in little gap distribution.

9. Directly into the sort simple selection sort bubble sort quick sort heap sort.

10. 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.