CFP last date
20 June 2024
Reseach Article

Magnetic Bubble Sort Algorithm

by Obed Appiah, Ezekiel Mensah Martey
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 122 - Number 21
Year of Publication: 2015
Authors: Obed Appiah, Ezekiel Mensah Martey

Obed Appiah, Ezekiel Mensah Martey . Magnetic Bubble Sort Algorithm. International Journal of Computer Applications. 122, 21 ( July 2015), 24-28. DOI=10.5120/21850-5168

@article{ 10.5120/21850-5168,
author = { Obed Appiah, Ezekiel Mensah Martey },
title = { Magnetic Bubble Sort Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { July 2015 },
volume = { 122 },
number = { 21 },
month = { July },
year = { 2015 },
issn = { 0975-8887 },
pages = { 24-28 },
numpages = {9},
url = { },
doi = { 10.5120/21850-5168 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Journal Article
%1 2024-02-06T23:11:09.134339+05:30
%A Obed Appiah
%A Ezekiel Mensah Martey
%T Magnetic Bubble Sort Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 122
%N 21
%P 24-28
%D 2015
%I Foundation of Computer Science (FCS), NY, USA

Sorting a list of items is one basic task in many applications used on the computer. The term describes the arrangement of a set of items in a certain order to make analysis and processing very easy. Numerous sorting algorithms exist however its efficiency and memory space consumption become a major issue when it has to be implemented. Essentially, programmers select sort algorithms that perform well even as the size of the input data increases. In this study, a new algorithm, Magnetic Bubble Sort Algorithm (MBS) is proposed. The MBS is an enhancement of the bubble sort algorithm which offers a far better performance in the case where redundancies occur in the list. The run time of the MBS depends on the number of distinct values that are found in the list to be sorted. The improved bubble sort algorithm is very simple to analyse, considering the fact that the time complexity of the algorithm depends on two main factors that is the size of list (n) and number of distinct values in the list.

  1. Batcher, K. E. , Sorting networks and their applications, Spring Joint Computer Conference, AFIPS Proc, 1968
  2. Cormen, T. H. , Leiserson, C. E. , Rivest, R. L. , and Stein, C. 2001. Introduction to Algorithms. MIT Press. Cambridge. MA. 2nd edition. 2001
  3. "Design and Analysis of Hybrid Selection Sort Algorithm". International Journal of Applied Research and Studies (iJARS) ISSN: 2278-9480 Volume 2, Issue 7 (July- 2013) www. ijars. in
  4. Hayfron-Acquah J. B. , Appiah O. , Riverson K. , Improved Selection Sort Algorithm, International Journal of Computer Applications 01/2015
  5. Jadoon, S. , Solehria, S. F. , Qayum, M. , "Optimized Selection Sort Algorithm is faster than Insertion Sort Algorithm: a Comparative Study" International Journal of Electrical & Computer Sciences IJECS-IJENS Vol: 11 No: 02, 2011
  6. Kapur, E. , Kumar, P. and Gupta, S. , "Proposal of a two way sorting algorithm and performance comparison with existing algorithms". International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol. 2, No. 3, June 2012
  7. Karunanithi A. K. , A Survey, Discussion and Comparison of Sorting Algorithms, June 2014
  8. Khairullah, M. "Enhancing Worst Sorting Algorithms". International Journal of Advanced Science and Technology Vol. 56, July, 2013
  9. Knuth, D. The Art of Computer Programming, Volume 3: Sorting and Searching, Second Edition. Addison-Wesley, 1998. ISBN 0-201-89685-0.
Index Terms

Computer Science
Information Sciences


Algorithms sorting algorithms bubble sort exchange sort redundancies in dataset