Heuristic and pattern based Merge Sort

Abstract

The aim of this study is to present a stable and adaptable Merge Sort algorithm that uses the design patterns to reduce computational complexity of swaps and memory usage. The order of Settlement of elements recorded by design patterns and merging one element by another (first phase) replaced with chunk merging. This algorithm has been implemented by C++ programming language.