University Links: Home Page | Site Map
Covenant University Repository

Improving the performance of bubble sort using a modified diminishing increment sorting

Oyelami, O. M. (2009) Improving the performance of bubble sort using a modified diminishing increment sorting. Scientific Research and Essay, 4 (8). pp. 740-744. ISSN 1992-2248

PDF - Published Version
Download (72Kb) | Preview


Sorting involves rearranging information into either ascending or descending order. There are many sorting algorithms, among which is Bubble Sort. Bubble Sort is not known to be a very good sorting algorithm because it is beset with redundant comparisons. However, efforts have been made to improve the performance of the algorithm. With Bidirectional Bubble Sort, the average number of comparisons is slightly reduced and Batcher’s Sort similar to Shellsort also performs significantly better than Bidirectional Bubble Sort by carrying out comparisons in a novel way so that no propagation of exchanges is necessary. Bitonic Sort was also presented by Batcher and the strong point of this sorting procedure is that it is very suitable for a hard-wired implementation using a sorting network. This paper presents a meta algorithm called Oyelami’s Sort that combines the technique of Bidirectional Bubble Sort with a modified diminishing increment sorting. The results from the implementation of the algorithm compared with Batcher’s Odd-Even Sort and Batcher’s Bitonic Sort showed that the algorithm performed better than the two in the worst case scenario. The implication is that the algorithm is faster.

Item Type: Article
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: Mr Adewole Adewumi
Date Deposited: 17 Feb 2011 18:05
Last Modified: 13 Dec 2011 21:13

Actions (login required)

View Item View Item