%0 Journal Article %1 harshdesign %A Harsh, Ranjan %A Sumit, Agarwal %A Niraj, Singh Kumar %D 2015 %J International Journal on Foundations of Computer Science & Technology %K Algorithm Analysis Binomial Distribution Empirical Model Poisson RA Theoretical Uniform quick sort %N 1 %P 59 - 66 %R DOI:10.5121/ijfcst.2015.5106 59 %T Design and Analysis of RA Sort %U https://wireilla.com/papers/ijfcst/V5N1/5115ijfcst06.pdf %V 5 %X This paper introduces a new comparison base stable sorting algorithm, named RA sort. The RA sort involves only the comparison of pair of elements in an array which ultimately sorts the array and does not involve the comparison of each element with every other element. It tries to build upon the relationship established between the elements in each pass. Instead of going for a blind comparison we prefer a selective comparison to get an efficient method. Sorting is a fundamental operation in computer science.This algorithm is analysed both theoretically and empirically to get a robust average case result. We have performed its Empirical analysis and compared its performance with the well-known quick sort for various input types. Although the theoretical worst case complexity of RA sort is Yworst(n) = O(n√݊), the experimental results suggest an empirical Oemp(nlgn)1.333 time complexity for typical input instances, where the parameter n characterizes the input size. The theoretical complexity is given for comparison operation. We emphasize that the theoretical complexity is operation specific whereas the empirical one represents the overall algorithmic complexity

@article{harshdesign, abstract = {This paper introduces a new comparison base stable sorting algorithm, named RA sort. The RA sort involves only the comparison of pair of elements in an array which ultimately sorts the array and does not involve the comparison of each element with every other element. It tries to build upon the relationship established between the elements in each pass. Instead of going for a blind comparison we prefer a selective comparison to get an efficient method. Sorting is a fundamental operation in computer science.This algorithm is analysed both theoretically and empirically to get a robust average case result. We have performed its Empirical analysis and compared its performance with the well-known quick sort for various input types. Although the theoretical worst case complexity of RA sort is Yworst(n) = O(n√݊), the experimental results suggest an empirical Oemp(nlgn)1.333 time complexity for typical input instances, where the parameter n characterizes the input size. The theoretical complexity is given for comparison operation. We emphasize that the theoretical complexity is operation specific whereas the empirical one represents the overall algorithmic complexity}, added-at = {2018-10-25T11:01:40.000+0200}, author = {Harsh, Ranjan and Sumit, Agarwal and Niraj, Singh Kumar}, biburl = {https://www.bibsonomy.org/bibtex/27388850359eb5ac6b73544ca18d31635/devino}, doi = {DOI:10.5121/ijfcst.2015.5106 59}, interhash = {09bfc2ae39c25be4214c464a9f901db4}, intrahash = {7388850359eb5ac6b73544ca18d31635}, issn = {1839-7662}, journal = {International Journal on Foundations of Computer Science & Technology}, keywords = {Algorithm Analysis Binomial Distribution Empirical Model Poisson RA Theoretical Uniform quick sort}, language = {English}, month = {January}, number = 1, pages = {59 - 66}, timestamp = {2018-10-25T11:01:40.000+0200}, title = {Design and Analysis of RA Sort}, url = {https://wireilla.com/papers/ijfcst/V5N1/5115ijfcst06.pdf}, volume = 5, year = 2015 }