Google scholar arxiv informatics ads IJAIS publications are indexed with Google Scholar, NASA ADS, Informatics et. al.

Call for Paper


July Edition 2023

International Journal of Applied Information Systems solicits high quality original research papers for the July 2023 Edition of the journal. The last date of research paper submission is June 15, 2023.

Min-Max Select Bubble Sorting Algorithm

Dhwaneel Trivedi, Prathmesh Trivedi, Suraj Singh Published in Algorithm

IJAIS Proceedings on International Conference and workshop on Advanced Computing 2013
Year of Publication: 2013
© 2012 by IJAIS Journal
Download full text
  1. Dhwaneel Trivedi, Prathmesh Trivedi and Suraj Singh. Article: Min-Max Select Bubble Sorting Algorithm. IJAIS Proceedings on International Conference and workshop on Advanced Computing 2013 ICWAC(1):11-16, June 2013. BibTeX

    	author = "Dhwaneel Trivedi and Prathmesh Trivedi and Suraj Singh",
    	title = "Article: Min-Max Select Bubble Sorting Algorithm",
    	journal = "IJAIS Proceedings on International Conference and workshop on Advanced Computing 2013",
    	year = 2013,
    	volume = "ICWAC",
    	number = 1,
    	pages = "11-16",
    	month = "June",
    	note = "Published by Foundation of Computer Science, New York, USA"


The paper is on Sorting Algorithm which uses modified Selection Sort and modified Bubble sort. It contains explanation of procedural concept of algorithm along with implemented Algorithm. It also contains calculation on Time complexity of algorithm and highlights the key benefits of using this sorting algorithm.


  1. E. Horowitz,S. Sahni,S. Rajasekaran, " Fundamentals of Computer Algorithms",pp. 165-174.
  2. Y. Langsam,M. Augenstein,A. Tenenbaum,"Data Structures Using Java",pp. 364-365.
  3. N. Dell,D. Joyce,C. Weems,"Object-oriented data structures using java",pp. 678-682.
  4. R. Lorentz, " Recursive algorithms",pp. 54.
  5. D. Sharma,V. Thapar,R. A. Ammar,S. Rajasekaran,M. Ahmed, "Efficient sorting algorithms for the cell broadband engine,"Computers and Communications,2008. ISCC 2008. IEEE Symposium.
  6. F. G. Khan,O. U. Khan, B. Montrucchio, P. Giaccone , "Frontiers of Information Technology(FIT)" ,2011.
  7. S. Rajasekaran, S. Sahni, "Sorting, Selection, and Routing on the Arraywith ReconfigurableOptical Buses", IEEE Transactions,VOL 8. NO. 11. 1997.
  8. S. Khamitkar,P. Bhalchandra,S. Lokhande,N. Deshmukh, "The Folklore of Sorting Algorithms",IJCSI Journal,Vol. 4, NO. 2,2009.
  9. V. Mansotra,K. Sourabh, "Implementing Bubble Sort Using a New Approach",INDIACom-2011.
  10. N. Arora,S. Kumar,V. Tamta,"A Novel Sorting Algorithm and comparison with Bubble Sort and Insertion Sort",IJCA,2012.
  11. Flores, I. "Analysis of Internal Computer Sorting". J. ACM 7,4 (Oct. 1960), 389- 409.
  12. Knuth, D. "The Art of Computer programming Sorting and Searching" , 2nd edition, vol. 3. Addison- Wesley, 1998.
  13. J. L. Bentley and R. Sedgewick. "Fast Algorithms for Sorting and Searching Strings", ACM-SIAM SODA 97, 360-369, 1997.
  14. N. Murthy, " Min-max sort: a simple sorting method" CSC '87 Proceedings of the 15th annual conference on Computer Science Page 365 ACM ,USA.
  15. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. "Introduction to Algorithms". MIT Press, Cambridge, MA, 2nd edition, 2001.
  16. J. Alnihoud and R. Mansi, "An Enhancement of Major Sorting Algorithms",The International Arab Journal of Information Technology,Vol 7, No. 1, January 2010.
  17. S. Chand,T. Chaudhary,R. Parveen,"Upgraded Selection Sort",IJCSE,Vol. 3,No. 4,April2011.
  18. A. Grama,A. Gupta,G. Karypis,V. Kumar, "Introduction to Parallel Computing",Second Edition,Addison-Wesley


Sort,Select,Leftmost bound, Rightmost bound,Minimum, Maximum