Performance Comparison between Merge and Quick Sort Algorithms in Data Structure

In computer science field, one of the basic operation is sorting. Many sorting operations use intermediate steps. Sorting is the procedure of ordering list of elements in ascending or descending with the help of key value in specific order. Many sorting algorithms have been designed and are being used. This paper presents performance comparisons among the two sorting algorithms, one of them merge sort another one is quick sort and produces evaluation based on the performances relating to time and space complexity. Both algorithms are vital and are being focused for long period but the query is still, which of them to use and when. Therefore this research study carried out. Each algorithm resolves the problem of sorting of data with a unique method. This study offers a complete learning that how both of the algorithms perform operation and then distinguish them based on various constraints to come with outcome.

@article{Ali2018,
  title     = {Performance Comparison between Merge and Quick Sort Algorithms in Data Structure},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {9},
  number    = {11},
  year      = {2018},
  publisher = {The Science and Information Organization},
  author    = {Irfan Ali and Haque Nawaz and Imran Khan and Abdullah Maitlo and M. Ameen Chhajro and M. Malook Rind},
  doi       = {10.14569/IJACSA.2018.091127},
  url       = {https://doi.org/10.14569/IJACSA.2018.091127}
}