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

Sorting
Merging

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
Vignesh, R. ; Pradhan, Tribikram. / Merge sort enhanced in place sorting algorithm. Proceedings of 2016 International Conference on Advanced Communication Control and Computing Technologies, ICACCCT 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 698-704
@inproceedings{02e945beee7443fba255a4ced2c4df14,
title = "Merge sort enhanced in place sorting algorithm",
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.",
author = "R. Vignesh and Tribikram Pradhan",
year = "2017",
month = "1",
day = "24",
doi = "10.1109/ICACCCT.2016.7831730",
language = "English",
pages = "698--704",
booktitle = "Proceedings of 2016 International Conference on Advanced Communication Control and Computing Technologies, ICACCCT 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

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., 7831730, Institute of Electrical and Electronics Engineers Inc., pp. 698-704, 2016 International Conference on Advanced Communication Control and Computing Technologies, ICACCCT 2016, Ramanathapuram, Tamil Nadu, India, 25-05-16. https://doi.org/10.1109/ICACCCT.2016.7831730

Merge sort enhanced in place sorting algorithm. / Vignesh, R.; Pradhan, Tribikram.

Proceedings of 2016 International Conference on Advanced Communication Control and Computing Technologies, ICACCCT 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 698-704 7831730.

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

TY - GEN

T1 - Merge sort enhanced in place sorting algorithm

AU - Vignesh, R.

AU - Pradhan, Tribikram

PY - 2017/1/24

Y1 - 2017/1/24

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85014223820&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85014223820&partnerID=8YFLogxK

U2 - 10.1109/ICACCCT.2016.7831730

DO - 10.1109/ICACCCT.2016.7831730

M3 - Conference contribution

AN - SCOPUS:85014223820

SP - 698

EP - 704

BT - Proceedings of 2016 International Conference on Advanced Communication Control and Computing Technologies, ICACCCT 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

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