Oyelami, O. M. (2013) Bidirectional Bubble Sort Approach to Improving the Performance of Introsort in the Worst Case for Large Input Size. International Journal of Experimental Algorithms (IJEA), 4 (2). pp. 17-24.
![[img]](http://eprints.covenantuniversity.edu.ng/style/images/fileicons/application_pdf.png) |
PDF
Download (94kB) |
Abstract
Quicksort has been described as the best practical choice for sorting. It is faster than many algorithms for sorting on most inputs and remarkably efficient on the average. However, it is not efficient in the worst case scenarios as it takes O(n2). Research efforts have been made to enhance this algorithm for the worst case scenarios by improving the way the algorithm chooses its pivot element for partitioning, but these approaches have the disadvantage of increasing the algorithm’s average computing time. Introsort was, however, developed to overcome this limitation. This paper presents an approach that uses Bidirectional Bubble Sort to improve the performance of Introsort. Instead of using Insertion Sort as the last step of the sorting algorithm for small lists, the approach uses Bidirectional Bubble Sort. The results of the implementation and experimentation of this algorithm compared with Introsort shows its better performance in the worst case scenario as the size of the list increases.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Quicksort, Introsort, Bidirectional Bubble Sort, Worst Case, Improved Introsort. |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science |
| Depositing User: | Mrs Patricia Nwokealisi |
| Date Deposited: | 20 Oct 2015 14:17 |
| Last Modified: | 20 Oct 2015 14:17 |
| URI: | http://eprints.covenantuniversity.edu.ng/id/eprint/5604 |
Actions (login required)
 |
View Item |
