Performance Comparison between Merge and Quick Sort Algorithms in Data Structure
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2018, Vol 9, Issue 11
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
- EP ID EP417627
- DOI 10.14569/IJACSA.2018.091127
- Views 116
- Downloads 0
Survey of Wireless MANET Application in Battlefield Operations
In this paper, we present a framework for performance analysis of wireless MANET in combat/battle field environment. The framework uses a cross-layer design approach where four different kinds of routing protocols are co...
A Novel Efficient Forecasting of Stock Market Using Particle Swarm Optimization with Center of Mass Based Technique
This paper develops an efficient forecasting model for various stock price indices based on the previously introduced particle swarm optimization with center mass (PSOCOM) technique. The structure used in the proposed pr...
NHCA: Developing New Hybrid Cryptography Algorithm for Cloud Computing Environment
The amount of transmitted data through the internet become larger and larger every day. The need of an encryption algorithm that guarantee transmitting data speedily and in a secure manner become a must. The aim of the r...
A New Cryptosystem using Vigenere and Metaheuristics for RGB Pixel Shuffling
In this article we present a new approach using Vigenere and metaheuristics to resolve a problem of pixel shuffling to cipher an image. First the image is adapted to match the resolution system by transforming it to a li...
A Second Correlation Method for Multivariate Exchange Rates Forecasting
Foreign exchange market is one of the most complex dynamic market with high volatility, non linear and irregularity. As the globalization spread to the world, exchange rates forecasting become more important and complica...