Sorting is one of the most frequently needed computing tasks. Mergesort is one of the most elegant algorithms to solve the sorting problem. We present a novel sorting algorithm of Mergesort family that is more efficient than other Mergesort algorithms. Mathematical analysis of the proposed algorithm shows that it reduces the data move operations considerably. Profiling was done to verify the impact of proposed algorithm on time spent. Profiling results show that proposed algorithm shows considerable improvement over conventional Mergesort in the case of large records. Also, in the case of small records, proposed algorithm is faster than the classical Mergesort. Moreover the proposed algorithm is found to be more adaptive than Classical Mergesort.
Comments: 6 Pages.
[v1] 2012-08-18 13:05:14
Unique-IP document downloads: 427 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.