Abstract
In the present computer system, the data processing aspect, occupies the enormous processing frequency, approximately has the nearly 50% above CPU processing time is USES in the sort data. It can be seen that the data sorting algorithm has a high requirement on its own execution speed, so it is particularly important to implement a fast and good sorting algorithm. In this paper. The traditional merge sort algorithm uses two-way merge sort, which needs the same size of auxiliary space and data to be sorted, so it is necessary to improve it. The traditional merge sort method and an improved in-situ merge algorithm based on hand method are introduced, which is devoted to providing theoretical basis for improving the traditional data sort method.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call