An Implementation of Sorting Algorithm Based on Java Multi-thread Technology

An efficient implementation of quick sort algorithm based on java muti-thread technology was proposed for multi-core computer system. According to Divide-and-Conquer method, it divided the data into a number of segments, and then merged the segments into one with Merge Algorithm based on multi-thread. The experimental results showed that the new implementation is more effective than the traditional implementation. On the Dual-core computer, performance of the implementation increased by about 40%, the more core of computer, the better performance of the implementation.