CFP last date
16 December 2024
Call for Paper
January Edition
IJAIS solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 16 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Ordered Frequent Itemsets Matrix Based On Fp-Tree Structure And Apriori Algorithm

Abdulkader M. Al-Badani Abdualmajed A. Al-Khulaidi
Random Articles
Reseach Article

Min-Max Select Bubble Sorting Algorithm

Published on June 2013 by Dhwaneel Trivedi, Prathmesh Trivedi, Suraj Singh
journal_cover_thumbnail

International Conference and workshop on Advanced Computing 2013
Foundation of Computer Science USA
ICWAC - Number 1
June 2013
Authors: Dhwaneel Trivedi, Prathmesh Trivedi, Suraj Singh
42853bfb-a838-41a9-9055-5fa1fe569663

Dhwaneel Trivedi, Prathmesh Trivedi, Suraj Singh . Min-Max Select Bubble Sorting Algorithm. International Conference and workshop on Advanced Computing 2013. ICWAC, 1 (June 2013), 0-0.

@article{
author = { Dhwaneel Trivedi, Prathmesh Trivedi, Suraj Singh },
title = { Min-Max Select Bubble Sorting Algorithm },
journal = { International Conference and workshop on Advanced Computing 2013 },
issue_date = { June 2013 },
volume = { ICWAC },
number = { 1 },
month = { June },
year = { 2013 },
issn = 2249-0868,
pages = { 0-0 },
numpages = 1,
url = { /proceedings/icwac/number1/474-1303/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference and workshop on Advanced Computing 2013
%A Dhwaneel Trivedi
%A Prathmesh Trivedi
%A Suraj Singh
%T Min-Max Select Bubble Sorting Algorithm
%J International Conference and workshop on Advanced Computing 2013
%@ 2249-0868
%V ICWAC
%N 1
%P 0-0
%D 2013
%I International Journal of Applied Information Systems
Abstract

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.

References
  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
Index Terms

Computer Science
Information Sciences

Keywords

Sort Select Leftmost bound Rightmost bound Minimum Maximum