PROPOSAL OF A TWO WAY SORTING ALGORITHM AND PERFORMANCE COMPARISON WITH EXISTING ALGORITHMS
E. Kapur. International Journal of Computer Science, Engineering and Applications (IJCSEA), 02 (03):
61-78(June 2012)
DOI: 10.5121/ijcsea.2012.2306
Abstract
An algorithm is any well-defined procedure or set of instructions, that takes some input in the form of some values, processes them and gives some values as output. Sorting involves rearranging information into either ascending or descending order. Sorting is considered as a fundamental operation in computer science as it is used as an intermediate step in many operations. A new sorting algorithm namely ‘An Endto-End Bi-directional Sorting (EEBS) Algorithm’ is proposed to address the shortcomings of the current popular sorting algorithms. The goal of this research is to perform an extensive empirical analysis of the newly developed algorithm and present its functionality. The results of the analysis proved that EEBS is much more efficient than the other algorithms having O(n2 ) complexity, like bubble, selection and insertion sort..
%0 Journal Article
%1 noauthororeditor
%A Kapur, Eshan
%D 2012
%J International Journal of Computer Science, Engineering and Applications (IJCSEA)
%K algorithms networks
%N 03
%P 61-78
%R 10.5121/ijcsea.2012.2306
%T PROPOSAL OF A TWO WAY SORTING ALGORITHM AND PERFORMANCE COMPARISON WITH EXISTING ALGORITHMS
%U http://airccse.org/journal/ijcsea/papers/2312ijcsea06.pdf
%V 02
%X An algorithm is any well-defined procedure or set of instructions, that takes some input in the form of some values, processes them and gives some values as output. Sorting involves rearranging information into either ascending or descending order. Sorting is considered as a fundamental operation in computer science as it is used as an intermediate step in many operations. A new sorting algorithm namely ‘An Endto-End Bi-directional Sorting (EEBS) Algorithm’ is proposed to address the shortcomings of the current popular sorting algorithms. The goal of this research is to perform an extensive empirical analysis of the newly developed algorithm and present its functionality. The results of the analysis proved that EEBS is much more efficient than the other algorithms having O(n2 ) complexity, like bubble, selection and insertion sort..
@article{noauthororeditor,
abstract = {An algorithm is any well-defined procedure or set of instructions, that takes some input in the form of some values, processes them and gives some values as output. Sorting involves rearranging information into either ascending or descending order. Sorting is considered as a fundamental operation in computer science as it is used as an intermediate step in many operations. A new sorting algorithm namely ‘An Endto-End Bi-directional Sorting (EEBS) Algorithm’ is proposed to address the shortcomings of the current popular sorting algorithms. The goal of this research is to perform an extensive empirical analysis of the newly developed algorithm and present its functionality. The results of the analysis proved that EEBS is much more efficient than the other algorithms having O(n2 ) complexity, like bubble, selection and insertion sort..},
added-at = {2018-08-16T13:07:01.000+0200},
author = {Kapur, Eshan},
biburl = {https://www.bibsonomy.org/bibtex/2068d7f08dc5204b06391666dbc1d7f99/ijcsea},
doi = {10.5121/ijcsea.2012.2306},
interhash = {a75278271d92dad13b5f25adcdb169ea},
intrahash = {068d7f08dc5204b06391666dbc1d7f99},
issn = {2230 - 9616},
journal = {International Journal of Computer Science, Engineering and Applications (IJCSEA)},
keywords = {algorithms networks},
month = {June },
number = 03,
pages = {61-78},
timestamp = {2018-08-16T13:07:01.000+0200},
title = {PROPOSAL OF A TWO WAY SORTING ALGORITHM AND PERFORMANCE COMPARISON WITH EXISTING ALGORITHMS},
url = {http://airccse.org/journal/ijcsea/papers/2312ijcsea06.pdf},
volume = 02,
year = 2012
}