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

This is an Open Access publication published under CSC-OpenAccess Policy.
Publications from CSC-OpenAccess Library are being accessed from over 74 countries worldwide.
Performances of Modified Diminishing Increment Sorting In Improving the Performances of Some Sorting Algorithms
Oyelami Olufemi Moses
Pages - 1 - 23     |    Revised - 31-08-2020     |    Published - 01-10-2020
Volume - 8   Issue - 1    |    Publication Date - October 2020  Table of Contents
Diminishing Increment Sorting, Modified Diminishing Increment Sorting, Performance, Efficiency, Circlesort, Shellsort, Improved Shellsort, Oyelami’s Sort.
There are several sorting algorithms in existence. Some are well known while others are not so well known, but important. However, more and more are still being developed to take care of the weaknesses of the existing ones and to make sorting simpler to implement. One of such new algorithms is the Modified Diminishing Increment Sorting (MDIS). In this article, a review is carried out of this algorithm and the several existing algorithms it has been employed to improve. In addition, a variant of MDIS christened Circlesort which applies MDIS in a recursive manner is also presented. Its performance comparisons with MDIS and other notable algorithms in the best case, average case and the worst case are presented. This review will help prospective application developers that need to implement sorting determine when MDIS and its variant are strong and when the algorithms compared with them also have their own strengths so as to guide their choices.
1 Google Scholar 
2 refSeek 
3 Scribd 
1 H. C. Thomas, E. L. Charles, L. R. Ronald and S. Clifford. Introduction to Algorithms (3rd Edition). The Massachusetts Institute of Technology, 2011.
2 E. K. Donald. The Art of Computer Programming, Volume 3, Sorting and Searching, Second Edition. US: Addison-Wesley, 1998.
3 L. Nievergelt and K. Hinrichs. Algorithms and Data Structures With Applications to Graphics and Geometry. Global Text, 2011.
4 D. I. Lakshmi, "Performance Analysis of Four Different Types of Sorting Algorithms using Different Languages," Int. J. Trend Sci. Res. Dev., vol. Volume-2, no. Issue-2, pp. 535-541, 2018.
5 P. K. Chhatwani and J. S. Somani, "Comparative Analysis & Performance of Different Sorting Algorithm in Data Structure," Int. J. Adv. Res. Comput. Sci. Softw. Eng., vol. 3, no. 11, pp. 500-507, 2013.
6 N. Kumar and R. Singh, "Performance Comparison of Sorting Algorithms On The Basis Of Complexity," Int. J. Comput. Sci. Inf. Technol. Res., vol. 2, no. 3, pp. 394-398, 2014.
7 A. Dev Mishra and D. Garg, "Selection of Best Sorting Algorithm," Int. J. Intell. Inf. Process., vol. 2, no. December, pp. 363-368, 2008.
8 E. Kapur, "Proposal of a Two Way Sorting Algorithm and Performance Comparison with Existing Algorithms," Int. J. Comput. Sci. Eng. Appl., vol. 2, no. 3, pp. 61-78, 2012.
9 A. H. Elkahlout and A. Y. A. Maghari, "A comparative Study of Sorting Algorithms Comb , Cocktail and Counting Sorting," Int. Res. J. Eng. Technol., vol. 4, no. 1, pp. 1387-1390, 2017.
10 K. S. Al-Kharabsheh, I. M. AlTurani, A. M. I. AlTurani and N. I. Zanoon, "Review on Sorting Algorithms A Comparative Study," International Journal of Computer Science and Security (Ijcss), pp. 120-126, 2013.
11 K. K. Pandey, R. K. Bunkar and K. K. Raghuvanshi, "A Comparative Study of Different Types of comparison Based Sorting Algorithms in Data Structure," vol. 4, no. 2, pp. 304-309, 2014.
12 A. Bharadwaj and S. Mishra, "Comparison of Sorting Algorithms based on Input Sequences," Int. J. Comput. Appl., vol. 78, no. 14, pp. 7-10, 2013.
13 D. T. V. D. Rao and B. Ramesh, "Experimental Based Selection of Best Sorting Algorithm," Int. J. Mod. Eng. Res., vol. 2, no. 4, pp. 2908-2912, 2012.
14 R. Joshi, G. Panwar, and P. Pathak, "Analysis of Non-Comparison Based Sorting Algorithms: A Review," Ermt.Net, vol. 9359, no. 12, pp. 61-65, 2013.
15 M. O. Oyelami, A. A. Azeta and C. K. Ayo. "Improved Shellsort for the Worst-Case, the Best-Case and a Subset of the Average-Case Scenarios." Journal of Computer Science & Its Applications, vol. 14, no. 2, pp. 73-84, 2007.
16 P. Deitel. and H. Deitel. Java How to Program (9th edition), Prentice Hall, 2012.
17 A. S. Clifford. Data Structures and Algorithm Analysis, Edition 3.2 (C++ Version), Dover Publications, 2013.
18 R. Sedgewick. Algorithms, Addison-Wesley, 1983.
19 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, no. 6, pp. 760 - 766, 2008.
20 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.
21 B. Miller and D. Ranum. Problem Solving with Algorithms and Data Structures. Franklin Beedle Publishers, 2013.
22 O. M. Oyelami. "Improving the performance of bubble sort using a modified diminishing increment sorting." Scientific Research and Essays, vol. 4, no. 8, pp. 740-744, 2009.
23 R. Sedgewick. Algorithms in C. Addison-Wesley, 1998.
24 L. Anany. Introduction to the Design and Analysis of Algorithms (3rd Ediion), Addison-Wesley, 2012.
25 M. O. Oyelami and I. O. Akinyemi. "Improving the Performance of Quicksort for Average Case Through a Modified Diminishing Increment Sorting." Journal of Computing, vol. 3, no. 4, pp. 93-197, 2011.
26 R. C. Singleton. "Algorithm 347 (An Efficient Algorithm for Sorting With Minimal Storage)", Communications of the ACM, vol. 12, pp. 187-195, 1969.
27 D. Musser. "Introspective Sorting and Selection Algorithms." Software Practice and Experience, vol. 27, no. 8, pp. 983-993, 1997.
28 H. Bezemer and M. O. Oyelami. "A Variant of Modified Diminishing Increment Sorting: Circlesort and its Performance Comparison with some Established Sorting Algorithms." International Journal of Experimental Algorithms (IJEA), vol. 6, no. 2, pp. 14 - 24, 2016.
29 M. A Weiss. Data Structures and Algorithm Analysis in C++. Pearson Education. Inc., 2006.
Associate Professor Oyelami Olufemi Moses
College of Computing and Communication Studies, Computer Science Programme, Bowen University, Iwo - Nigeria