Conference Paper

Enhanced Merge Sort Using Simplified Transferrable Auxiliary Space

2017 International Conference on Computer Applications inIndustry and Engineering
Ziping Liu, Zirou Qiu, Xuesong Zhang

ABSTRACT



 This paper presents an enhanced implementation for the classic merge sort algorithm which reduces both the execution time as well as the extra space requirements. The main idea is to modify the merge procedure such that it only moves half of the input array into one single auxiliary array instead of the conventional whole array and two auxiliary arrays. Experimental data proves that the proposed implementation is faster than the conventional implementation. 

CAINE 2017



ISBN:
978-1-943436-04-0
PUBLISHER:
ISCA
CHIEF EDITOR:
Waheed
CONFERENCE VENUE:
San Diego, California, USA
CONTACT DETAILS:
Debnath
Copyright © Search Innovations. All rights reserved