Empirical Performance of Internal Sorting Algorithm
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 20, Issue 1
Abstract
Internal Sorting Algorithms are used when the list of records is small enough to be maintained entirely in primary memory for the duration of the sort, while External Sorting Algorithms are used when the list of records is large enough to be maintained in physical memory hence a need for external/secondary storage for the duration of the sort. Almost all operations carried out by computing devices involve sorting and searching which employs Internal Sorting Algorithms. In this paper, we present an empirical analysis of Internal Sorting Algorithms (bubble, insertion, quick shaker, shell and selection) using sample comprising of list of randomly generated integer values between 100 to 50,000 samples. Using C++ time function, it was observed that insertion sort has the best performance on small sample say between 100 to 400. But when the sample size increases to 500, Shaker sort has better performance. Furthermore, when the sample grows above 500 samples, shell sort outperforms all the internal sorting algorithms considered in the study. Meanwhile, selection sort has displayed the worst performance on data samples of size 100 to 30,000. As the samples size grows to further to 50,000 and above, the performance of shaker sort and bubble sort depreciates even below that of selection sort. And when the sample size increases further from 1000 and above then shell sort should be considered first for sorting.
Authors and Affiliations
Faki Ageebee Silas, Yusuf Musa, S. Akosu Joyce
Keywords
Related Articles
- EP ID EP321895
- DOI 10.9734/BJMCS/2017/29238
- Views 110
- Downloads 0
Analysis of a Repairable k-out-of-n:G System with Expert Repairman's Multiple Vacations and Shut off Rule
This paper investigates an k-out-of-n:G repairable system with expert repairman’s multiple vacations and continuous operation rule where the operating times and the repair times of components follow exponential distribut...
On the Notes of Quasi-Boundary Value Method for Solving Cauchy-Dirichlet Problem of the Helmholtz Equation
The Cauchy-Dirichlet problem of the Helmholtz equation yields unstable solution, which when solved with the Quasi-Boundary Value Method (Q-BVM) for a regularization parameter = 0. At this point of regularization parame...
Modelling In uenza Dynamics with Drug Resistance Aspect
Despite improvement in medical and public health standards, in uenza continues to plague humankind causing high morbidity,mortality and socio-economic cost. E orts to e ectively combat the spread of in uenza can be put i...
Modelling Miraa Addiction like a Disease Incorporating Voluntary Quitting
This study presented a deterministic model of miraa addiction based on three compartmental classes incorporating miraa specific attributes as well as the aspect of voluntary quitting. Our model was based on SIS classical...
Solving Multi-level Multi-objective Fractional Programming Problem with Rough Intervals in the Objective Functions
In this paper multi-level multi-objective fractional programming problem (ML-MOFP) is considered where some or all of its coefficients in the objective function are rough intervals. At the first phase of the solution app...