Merge sort enhanced in place sorting algorithm

R. Vignesh, Tribikram Pradhan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of 2016 International Conference on Advanced Communication Control and Computing Technologies, ICACCCT 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages698-704
Number of pages7
ISBN (Electronic)9781467395458
DOIs
Publication statusPublished - 24-01-2017
Event2016 International Conference on Advanced Communication Control and Computing Technologies, ICACCCT 2016 - Ramanathapuram, Tamil Nadu, India
Duration: 25-05-201627-05-2016

Conference

Conference2016 International Conference on Advanced Communication Control and Computing Technologies, ICACCCT 2016
CountryIndia
CityRamanathapuram, Tamil Nadu
Period25-05-1627-05-16

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Signal Processing
  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Vignesh, R., & Pradhan, T. (2017). Merge sort enhanced in place sorting algorithm. In Proceedings of 2016 International Conference on Advanced Communication Control and Computing Technologies, ICACCCT 2016 (pp. 698-704). [7831730] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICACCCT.2016.7831730