期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2012
卷号：3
期号：2
页码：212-217
语种：English
出版社：Ayushmaan Technologies
摘要：Sorting is the arrangement of records or elements in some mathematical or logical order. Merge sort is one among many sorting techniques. Several improvements on the merge sort procedure are done by different researchers that require less space for auxiliary memory and less number of conditions checking. In this paper, a new merge-sort technique is proposed which uses the design patterns to reduce computational complexity of swapping operation and memory usage. The order of settlement of elements is recorded by various design patterns and then merging of one phase of elements with another is replaced with chunk merging. The proposed technique uses the design patterns to create a memory pool of data to sort data. This algorithm has been implemented in JAVA and it is observed that the proposed algorithm performs better than all existing merge sort algorithms.
