Merge Sort Enhanced In Place Sorting Algorithm

Vignesh, R and Pradhan, Tribikram (2016) Merge Sort Enhanced In Place Sorting Algorithm. In: International Conference on Advanced Communication Control and Computing Technologies, 25/05/2016, Ramanathapuram, Tamilnadu.

[img] PDF
251.pdf - Published Version
Restricted to Registered users only

Download (660kB) | Request a copy

Abstract

This paper aims at introducing a new sorting algorithm which sorts the elements of an array In Place. This algorithm has O(n) best case Time Complexity and O(n log n) average and worst case Time Complexity. We achieve our goal using Recursive Partitioning combined with In Place merging to sort a given array. A comparison is made between this particular idea and other popular implementations. We finally draw out a conclusion and observe the cases where this outperforms other sorting algorithms. We also look at its shortcomings and list the scope for future improvements that could be made

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Time Complexity, In Place, Recursive Partitioning
Subjects: Engineering > MIT Manipal > Information and Communication Technology
Depositing User: MIT Library
Date Deposited: 20 Jul 2016 09:48
Last Modified: 20 Jul 2016 09:48
URI: http://eprints.manipal.edu/id/eprint/146655

Actions (login required)

View Item View Item