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 100
- Downloads 0
The Gamma Function and Its Analytical Applications
This paper explores the history and properties of the Gamma function with some analytical applications. Specifically, the Gamma function is employed to prove the legitimacy of the Standard Normal Distribution and for eva...
Fixed Point of Presic Type Mapping in G-Metric Spaces
In this paper, we give a xed point theorem for Presic type contractive mapping in G-metric space. We also present an example to validate our result.
Common Fixed Point Results for the (F; L)-Weak Contraction on Complete Weak Partial Metric Spaces
In this paper, we define the concepts of (F;L)-contraction and (F;L)-weak contraction in weak partial metric space which is generalized metric space. Using these concepts we prove some common fixed point theorems for two...
On Characterizations of Some Types of Fuzzy Soft Sets in Fuzzy Soft Bitopological Spaces
In this paper, we introduce and study the notion of kernal operator in fuzzy soft bitopological space. Moreover, some important results related to this notion are obtained. Furthermore, we introduce the concept of Alexan...
Some Fixed Point Theorems for Berinde-Type Contraction Mappings on Gp-Metric Spaces
In this paper, we de ne the concepts of (δ, 1 − δ)-weak contraction, (φ, 1 − δ)-weak contraction and Ciric-type almost contraction in the sense of Berinde in Gp-complete Gp-metric space. Furthermore, we prove the exist...