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

Dynamic Bandwidth Allocation in LAN using Dynamic Excess Rate Sensing

Today human and information processing system both need rapid access to anything they want on the internet. To fulfill these needs more and more internet service providers with a large amount of bandwidth are introducing...

 A Novel Approach for Troubleshooting Microprocessor based Systems using An Object Oriented Expert System

 The paper presents an object oriented fault diagnostic expert system framework which analyses observations from the unit under test when fault occurs and infers the causes of failures. The frame work is characteriz...

New Transport Layer Security using Metaheuristics and New Key Exchange Protocol

The easiness of data transmission is one of the information security flaws that needs to be handled rigorously. It makes eavesdropping, tampering and message forgery by malicious more simple. One of the protocols develop...

Improving the Recognition of Heart Murmur

Diagnosis of congenital cardiac defects is challenging, with some being diagnosed during pregnancy while others are diagnosed after birth or later on during childhood. Prompt diagnosis allows early intervention and best...

Intrusion Detection and Countermeasure of Virtual Cloud Systems - State of the Art and Current Challenges

Clouds are distributed Internet-based platforms that provide highly resilient and scalable environments to be used by enterprises in a multitude of ways. Cloud computing offers enterprises technology innovation that busi...

Download PDF file
  • EP ID EP417627
  • DOI 10.14569/IJACSA.2018.091127
  • Views 111
  • 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