Performance Comparison between Merge and Quick Sort Algorithms in Data Structure

Abstract

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.

Authors and Affiliations

Irfan Ali, Haque Nawaz, Imran Khan, Abdullah Maitlo, M. Ameen Chhajro, M. Malook Rind

Keywords

Related Articles

A Comparative Study of Engineering Students Pedagogical Progress

Students’ pedagogical progress plays a pivotal role in any educational institute in order to pursue imperative education. Educational institutes, Universities, Colleges implement various performance measures in order to...

Designing a Markov Model for the Analysis of 2-tier Cognitive Radio Network

Cognitive Radio Network (CRN) aims to reduce spectrum congestion by allowing secondary users to utilize idle spectrum bands in the absence of primary users. However, the overall user capacity and hence, the system throug...

Interface of an Automatic Recognition System for Dysarthric Speech

This paper addresses the realization of a Human/Machine (H/M) interface including a system for automatic recognition of the Continuous Pathological Speech (ARSCPS) and several communication tools in order to help frail p...

Efficient Traducer Tracing System Using Traffic Volume Information

 Many leading Broadband access technologies and their accessing abilities have the capability to meet the future requirements of the Broadband consumer. With the enormous growth in the broadband technologies, there...

A Global Convergence Algorithm for the Supply Chain Network Equilibrium Model

In this paper, we first present an auxiliary problem method for solving the generalized variational inequalities problem on the supply chain network equilibrium model (GVIP), then its global convergence is also establish...

Download PDF file
  • EP ID EP417627
  • DOI 10.14569/IJACSA.2018.091127
  • Views 63
  • Downloads 0

How To Cite

Irfan Ali, Haque Nawaz, Imran Khan, Abdullah Maitlo, M. Ameen Chhajro, M. Malook Rind (2018). Performance Comparison between Merge and Quick Sort Algorithms in Data Structure. International Journal of Advanced Computer Science & Applications, 9(11), 192-195. https://europub.co.uk/articles/-A-417627