- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
NK-SORTING ALGORITHM | ||
| Journal of Kufa for Mathematics and Computer | ||
| Article 1, Volume 1, Issue 4, 2013, Pages 27-35 | ||
| Authors | ||
| Assist .Prof. Dr. NIDHAL K. EL ABBADI; ZAID YAHYA A. KAREEM | ||
| Abstract | ||
| 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. | ||
| Keywords | ||
| Key Words; Time complexity; Integers; comparison; Time analysis; Space analysis | ||
|
Statistics Article View: 35 PDF Download: 23 |
||