Heuristic and pattern based Merge Sort | Zendy

Manouchehr Zadahmad | Zendy; Parisa Yousefzadeh Fard | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Heuristic and pattern based Merge Sort

Author(s) -

Manouchehr Zadahmad,

Parisa Yousefzadeh Fard

Publication year - 2011

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2010.12.055

Subject(s) - computer science , merge (version control) , sort , merge sort , merge algorithm , computational complexity theory , theoretical computer science , algorithm , parallel computing , sorting algorithm , database

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research