NK-SORTING ALGORITHM
DOI:
https://doi.org/10.31642/JoKMC/2018/010404Keywords:
Sorting, Time complexity,, Integers,, Comparison, Time analysis, , Space analysis.Abstract
Sorting has been a profound area for the algorithmic researchers and many resources are invested to suggest more works for sorting algorithms. For this purpose, many existing sorting algorithms were observed in terms of the efficiency of the algorithmic complexity.
Many algorithms are very well known for sorting the unordered lists.
In this proposed algorithm, we suggested a new algorithm for sorting integers number depending on dividing the input array to many sub-arrays (which represents a vector or array with one dimension), according to the number of digits in each integer number, the relation between sub-array elements is determined, and this relation used to determines the right location of each element in sub-arrays.
 Collision may happen, which is solved by moving elements in sub-array to next location. Finally, all ordered sub-arrays will be merged together to rebuild the origin array. The proposed algorithm compared with many famous algorithms gives promising results.
Â
Downloads
References
Aho A., Hopcroft J., and Ullman J., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
Box R. and Lacey S., “A fast, easy sort,” Byte Magazine, vol.16, no.4, pp.315-ff, April 1991.
Cormen T., Leiserson C., Rivest R., and Stein C., Introduction to Algorithms, 2nd edition, McGraw-Hill Book, 2001.
Donald Knuth. The Art of Computer Programming, Volume 3: Second Edition. Addison-Wesley, 1998. ISBN 0-201-89685-0. Section 5.2.1: Sorting by Insertion, pp.80–105
Kruse R., and Ryba A., Data Structures and Program Design in C++, International Edition, Prentice Hall, 1999.
Levitin A., Introduction to the Design & Analysis of Algorithms, 2nd Edition, Section 3.1: Selection Sort, pp 98-100, 2007.
Moller F., Analysis of Quicksort, Department of Computer Science, University of Wales Swansea, 2001.
Nyhoff L., An introduction to Data Structures, 2nd edition, pp: 581-585.
Thomas H. , et at. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262- 03293-7. Section 2.1: Insertion sort, pp.15–21.
Weiss M., Data Structures and Problem Solving using Java, Addison-Wesley, 2002.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2014 NIDHAL . K EL ABBADI, ZAID YAHYA A. KAREEM
This work is licensed under a Creative Commons Attribution 4.0 International License.
which allows users to copy, create extracts, abstracts, and new works from the Article, alter and revise the Article, and make commercial use of the Article (including reuse and/or resale of the Article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made and the licensor is not represented as endorsing the use made of the work.
