Performance Analysis of Bubble Sort Using a Modified Diminishing Increment Sorting
PERFORMANCE ANALYSIS OF BUBBLE SORT USING A MODIFIED DIMINISHING INCREMENT SORTING(A New Approach)
Mr. VIKAS BAJPAIB.TECH(CS) 3RD YEAR Department of CSE IEC-CET, GR. NOIDA lnbajpai09@rediffmail.com | Ms. SAMEHA ARORAB.TECH(CS) 3RD YEAR Department of CSE IEC-CET, GR. NOIDA sameha.arora@yahoo.com | Mr.ASHISH CHAKRAVARTIAssistant Professor Department of CSEIEC-CET,GR. NOIDAashish.me08@gmail.com | Prof. SHEO KUMARAssociate ProfessorDepartment of CSE IEC-CET, GR. NOIDA sheo@rediffmail.com |
ABSTRACT
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. 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 show the comparison between
iii.)Definiteness: Each step of an algorithm must be precisely defined, the actions to be carried out must be rigorously specified for each case.
iv.) Output: An algorithm has one or more outputs-quantities that have a specified relation to inputs.
v.) Effectiveness: An algorithm is also generally expected to be effective, in the sense that its operations must all be sufficiently basic that they can in principle be done exactly and in a finite length of time by someone using pencil and paper.
different sorting methods as well as comparison between theoretical and practical values.The mathematical analysis has also been done of Oyelami’s sort.
KEYWORDS:Algorithm,Sorting,Bubble sort,Best case
Worst case,Average case,Comparison,Swapping.
INTRODUCTION
Using
Mr. VIKAS BAJPAIB.TECH(CS) 3RD YEAR Department of CSE IEC-CET, GR. NOIDA lnbajpai09@rediffmail.com | Ms. SAMEHA ARORAB.TECH(CS) 3RD YEAR Department of CSE IEC-CET, GR. NOIDA sameha.arora@yahoo.com | Mr.ASHISH CHAKRAVARTIAssistant Professor Department of CSEIEC-CET,GR. NOIDAashish.me08@gmail.com | Prof. SHEO KUMARAssociate ProfessorDepartment of CSE IEC-CET, GR. NOIDA sheo@rediffmail.com |
ABSTRACT
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. 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 show the comparison between
iii.)Definiteness: Each step of an algorithm must be precisely defined, the actions to be carried out must be rigorously specified for each case.
iv.) Output: An algorithm has one or more outputs-quantities that have a specified relation to inputs.
v.) Effectiveness: An algorithm is also generally expected to be effective, in the sense that its operations must all be sufficiently basic that they can in principle be done exactly and in a finite length of time by someone using pencil and paper.
different sorting methods as well as comparison between theoretical and practical values.The mathematical analysis has also been done of Oyelami’s sort.
KEYWORDS:Algorithm,Sorting,Bubble sort,Best case
Worst case,Average case,Comparison,Swapping.
INTRODUCTION
Using
References: * Scientific Research & Essay Vol 4 (8), pp.740- 744,August, 2009.Available online at http:// * Alfred V, Aho J, Horroroft, Jeffrey DU (2002). Data Structures and Algorithms (India: Pearson Education Asia). * Donald EK (1997). The Art of Computer Programming, Volume I, Fundamental Algorithms; Third Edition. US: Addison-Wesley. * Donald EK (1998). The Art of Computer Programming, Volume 3, Sorting and Searching, Second Edition. Addison-Wesley. * Frank MC (2004). Data Abstraction and Problem Solving with C++. US: Pearson Education, Inc. * Oyelami MO (2008). A Modified Diminishing Increment Sort for Overcoming the Search for Best Sequence of Increment for Shellsort”. J. Appl. Sci. Res., 4 (6): 760- 766. * Oyelami MO, Azeta AA, Ayo CK (2007). Improved Shellsort for the Worst-Case, the Best-Case and a Subset of the Average-Case Scenarios. J. Comput. Sci Appl. 14 (2): 73- 84. * Robert S (1998). Algorithms in C. Addison-Wesley Publishing Company, Inc. * Sara B, Allen G (2000). Computer Algorithms. US: Addison Wesley Longman. * Sartaj S (2000). Data Structures, Algorithms and Applications in Java. McGrawHill. * Shola PB (2003). Data Structures With Implementation in C and Pascal. Nigeria: Reflect Publish