Fast Sorting Method of Separating Segment according Bit Field
Xiangyang Wang · Microelectronics & Computer · 2006
In this paper,a new algorithm consisted of separating segment,mapping and quick sort according bit field is presented。 The algorithm analysis and experimental results show that the new sorting algorithm has the time complexity of O(N ),requires no more than N+M(here M is the number of segment,1≤M≤N ) extra space only,and is obviously quicker than that of Quick Sort,Proportion Split Sort et al。