|
|
Bit-split parallel algorithm for quick sorting based on Java
TUO Qing SONG Yao-hu
Journal of Computer Applications
2012, 32 (09):
2455-2457.
DOI: 10.3724/SP.J.1087.2012.02455
This paper presented a new sorting algorithm based on bit-split quick sort that aimed to explore the algorithm which had excellent performance for large data. The algorithm split data in bit, and parallel processed the split data in combination with Java's concurrent mechanism. The data experiments show that the new sorting algorithm is significantly better than quick sort for large data sorting and owns very good parallel efficiency.
Reference |
Related Articles |
Metrics
|
|
