Enhanced Bidirectional Selection Sort
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 33087
Enhanced Bidirectional Selection Sort

Authors: Jyoti Dua

Abstract:

An algorithm is a well-defined procedure that takes some input in the form of some values, processes them and gives the desired output. It forms the basis of many other algorithms such as searching, pattern matching, digital filters etc., and other applications have been found in database systems, data statistics and processing, data communications and pattern matching. This paper introduces algorithmic “Enhanced Bidirectional Selection” sort which is bidirectional, stable. It is said to be bidirectional as it selects two values smallest from the front and largest from the rear and assigns them to their appropriate locations thus reducing the number of passes by half the total number of elements as compared to selection sort.

Keywords: Bubble sort, cocktail sort, selection sort, heap sort.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1337725

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2372

References:


[1] D. Knuth, “The Art of Computer Programming (Sorting and Searching),” 3rd ed. vol. 3, Addison-Wesley, 1997, ISBN 0-201-89685- 0. pp. 138–14, 1997.
[2] J.W.J Williams, Algorithm 232: Heap sort. Comm. ACM 7, 6 June 1964, pp.347-348.
[3] Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, Introduction to Algorithms. McGraw-Hill, New York.
[4] Aho, A.V.,Hopcroft,J.E. Ullman,J.D.,”Algorithms and Data Structure”, Pearson India, Reprint 2000.
[5] Z. Iqbal, H. Gull and A.W. Muzaffar “A New Friends Sort Algorithm”, 2nd IEEE Int. Conf. Software Engineering and Information Technology, ISBN 978-1-4244-4520-2, pp 326-329,2009.
[6] Seymour Lipschutz. Schaum’s “Selection Sort (Outline Series Theory and Problems of Data Structures)”, Int. ed. McGraw-Hill, 1986. ISBN 0- 07-099130-8, pp. 324–325, ch. 9.
[7] Nidhi Chhajed, Simarjeet Singh Bhatia,”A Comparison based Analysis of different types of Sorting Algorithm with their performance”,Indian Journal of Research PARIPEX,Vol 2,Issue 3,March 2013.
[8] D.T.V Dharmajee Rao, B.Ramesh, ”Experimental Based Selection of Best Sorting”, International Journal of Modern Engineering Research (IJMER),vol. 2, no. 4, July-Aug 2012 ISSN 2249-6645 pp-2908-2912.
[9] Eshan Kapur, Parveen Kumar and Sahil Gupta,” 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.
[10] Jehad Alnihoud and Rami Mansi, “An Enhancement of Major Sorting Algorithms”, The International Arab Journal of Information Technology, Vol. 7, no. 1, January 2010.