Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available

(502.49KB)
This is an Open Access publication published under CSC-OpenAccess Policy.

PUBLICATIONS BY COUNTRIES

Top researchers from over 74 countries worldwide have trusted us because of quality publications.

United States of America
United Kingdom
Canada
Australia
Malaysia
China
Japan
Saudi Arabia
Egypt
India
A Variant of Modified Diminishing Increment Sorting: Circlesort and its Performance Comparison with some Established Sorting Algorithms
Hans Bezemer, Olufemi Moses Oyelami
Pages - 14 - 25     |    Revised - 30-11-2016     |    Published - 31-12-2016
Volume - 6   Issue - 2    |    Publication Date - December 2016  Table of Contents
MORE INFORMATION
KEYWORDS
Circlesort, Modified Diminishing Increment Sorting, Shellsort, Quicksort, Introsort, Heapsort.
ABSTRACT
The essence of the plethora of sorting algorithms available is to have varieties that suit different characteristics of data to be sorted. In addition, the real goal is to have a sorting algorithm that is both efficient and easy to implement. Towards achieving this goal, Shellsort improved on Insertion sort, and various sequences have been proposed to further improve the performance of Shellsort. The best of all the improvements on Shellsort in the worst case is the Modified Diminishing Increment Sorting (MDIS). This article presents Circlesort, a variant of MDIS. The results of the implementation and experimentation of the algorithm with MDIS and some notable sorting algorithms showed that it performed better than the established algorithms considered in the best case and worst case scenarios, but second to MDIS. The results of the performance comparison of the algorithms considered also show their strengths and weaknesses in different scenarios. This will guide prospective users as to the choice to be made depending on the nature of the list to be sorted.
1 Google Scholar 
2 CiteSeerX 
3 Scribd 
4 SlideShare 
5 PdfSR 
1 M. A. Weiss. Data Structures and Algorithm Analysis in C++. 3rd edition, Boston: Pearson Addison-Wesley, 2006, pp. 266
2 E. K. Donald. The Art of Computer Programming, Volume 3, Sorting and Searching, Second Edition., Boston: Addison-Wesley, 1998, pp. 74, 83, 84, 93.
3 D. L. Shell. "A High-Speed Sorting Procedure." Communications of the ACM, vol. 2, pp. 30-32, Jan. 1959.
4 A. A. Papernov and G.V. Stasevich. "A Method of Information Sorting in Computer Memories." Problems of Information Transmission, vol. 1, pp. 63-75, 1965.
5 M. O. Oyelami. "A Modified Diminishing Increment Sort for Overcoming the Search for Best Sequence of Increment for Shellsort." Journal of Applied Sciences Research, vol. 4, pp. 760-766, 2008.
6 O. M. Oyelami (2008, August). "Improving the performance of bubble sort using a modified diminishing increment sorting." Scientific Research and Essay [On-line]. 4(8), pp. 740-744. Available: http://www.academicjournals.org/journal/SRE/article-stat/2A1D65C19516 [October 31, 2016].
7 M.O. Oyelami and I.O. Akinyemi (2011, April). "Improving the Performance of Quicksort for Average Case Through a Modified Diminishing Increment Sorting." Journal of Computing [On-line]. 3(4), pp. 193-197. Available: https://www.scribd.com/document/54847050/Improving-the-Performance-of-Quicksort-for-Average-Case-Through-a-Modified-Diminishing-Increment-Sorting [October 31, 2016].
8 O. M. Oyelami (2013, November). "Bidirectional Bubble Sort Approach to Improving the Performance of Introsort in the Worst Case Size for Large Input." International Journal of Experimental Algorithms [On-line]. 4 (2), pp. 17-24 Available: http://www.cscjournals.org/library/ma.scriptinfo.php?mc=IJEA-35. [October 31, 2016].
9 X. Yi-Si, X. P. Liu and X. Shao-Ping. "Efficient collision detection based on AABB trees and sort algorithm," in Proc. 8th IEEE International Conference on Control & Automation (ICCA '10), 2010, pp. 328-332.
10 C.G. Plaxton, B. Poonen and T. Suel. "Improved lower bounds for Shellsort," in Proc. 33rd IEEE` Symp. Foundat. Comput. Sci., 1992, pp. 226-235.
11 T. Jiang, M. Li, and P. Vitány (2000, September). "A lower bound on the average-case complexity of Shellsort." Journal of the ACM (JACM) [On-line]. 47 (5), pp. 905-911.Available: http://homepages.cwi.nl/~paulv/papers/shellsort.pdf [December 20, 2016].
12 . M. T. Goodrich. "Randomized shellsort: A simple oblivious sorting algorithm," in Proc. Twenty-first annual ACM-SIAM symposium on Discrete Algorithms, 2010, pp. 1262-1277.
13 R. Sedgewick. "Analysis of Shellsort and related algorithms," inProc. ESA '96: The Fourth Annual European Symposium on Algorithms, 1996, pp. 1-11.
14 W. Dobosiewicz. "An efficient variation of bubble sort.".Inf. Process. Lett., vol. 11. pp. 5-6, Jan. 1980.
15 S. Sartaj. Data Structures, Algorithms and Applications in Java, International Edition, Boston, Massachusetts: McGrawHill, 2000, pp. 67.
Mr. Hans Bezemer
Ordina N.V. - Netherlands
Dr. Olufemi Moses Oyelami
Faculty of Science and Science Education Department of Computer Science and Information Technology Bowen University, Iwo, Nigeria - Nigeria
olufemioyelami@gmail.com