An Comparative Analysis Of NEETís (Negate Extended Elements Time In Sorting) Algorithm With Bubble Sort And Cocktail Sort In Matlab

Download PDF
Full text version
Authors : Ayush Kumar Yogi
Publication Date: 14-06-2013


Author(s):  Ayush Kumar Yogi

Published in:   International Journal of Engineering Research & Technology

License:  This work is licensed under a Creative Commons Attribution 4.0 International License.

Website: www.ijert.org

Volume/Issue:   Vol.2 - Issue 6 (June - 2013)

e-ISSN:   2278-0181


NEET°«s (Negate Extended Elements Time in sorting) algorithm is new technique to sort numeric numbers in respect to reducing the time at operational level. NEET°«s algorithm is bidirectional as cocktail sort but dissimilarities are there in operational style and concept compared to bubble sort and cocktail sort. For measuring actual time that all three algorithms spend I have used MATLAB version R2007b. Bubble sort operates in one direction and cocktail sort adopt the mechanism of bubble sort but operates in respectively in two directions. Cocktail sort also named as bidirectional bubble sort, but due to its number of calculations in each pass it is not able to produce results on efficient time constraint. NEET°«s algorithm operates in two directions respectively by taking constant sets of two positions in array for each direction. NEET°«s performance is efficient on large number of elements comparing to bubble and cocktail as analyzed.


Number of Citations for this article:  Data not Available


Key Word(s):    


Number of Downloads:     98