Performance Comparison between Merge and Quick Sort Algorithms in Data Structure

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

doi:10.14569/ijacsa.2018.091127

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.

Highlights

An algorithm is any well- defined computational or step by step process for resolving a problem
In mathematics and computer science, an algorithm usually means a logical depiction of the commands which must be performed significant activity [1]
The main factor of analysis of algorithm is to study about time and space and their relationship between the algorithms necessities and number of elements or items being executed or processed

Summary

INTRODUCTION

An algorithm is any well- defined computational or step by step process for resolving a problem. It takes some values as input and produces some values as output; it will terminate finite number of steps. In mathematics and computer science, an algorithm usually means a logical depiction of the commands which must be performed significant activity [1]. Many software engineers in their area of programming they are depending on the different sorting algorithms: i-e. Merge, Quick sort etc. Sorting is universally globally sorting is performed and it is known as essential activity. Most important sorting application is used in daily life. A. Computational Complexity Sorting algorithms, computational complexities, are based on:

RESEARCH METHODS AND DISCUSSION

Computational Method of Quick Sort

CONCLUSION