Decremental Sorting Algorithm: A Non-Comparison Sorting Technique
Keywords:
Sorting, Sorting Algorithm, comparison based sorting, non-comparison sortingAbstract
Data is the fundamental element in computer science. We have to manipulate data as per our need. While working with data, we used to perform many operations. Sorting of data is one the very important problem. Many sorting algorithms have been proposed, that are categorized in two classes: comparison based sorting algorithms and non-comparison sorting algorithms. This paper discusses some of the well-known sorting algorithms and also proposes a new sorting technique which is non-comparison sorting technique, whereas its complexity is O (N.M), which is better than some well know sorting algorithms.
Downloads
Published
How to Cite
Issue
Section
License
University of Sindh Journal of Information and Communication Technology (USJICT) follows an Open Access Policy under Attribution-NonCommercial CC-BY-NC license. Researchers can copy and redistribute the material in any medium or format, for any purpose. Authors can self-archive publisher's version of the accepted article in digital repositories and archives.
Upon acceptance, the author must transfer the copyright of this manuscript to the Journal for publication on paper, on data storage media and online with distribution rights to USJICT, University of sindh, Jamshoro, Pakistan. Kindly download the copyright for below and attach as a supplimentry file during article submission
