CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Two Approaches of Natural Numbers Sorting: TAISN and Improved Array-Indexed Algorithms

by Abdullah Sheneamer, Ahmed Alharthi, Hanan Hazazi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 121 - Number 8
Year of Publication: 2015
Authors: Abdullah Sheneamer, Ahmed Alharthi, Hanan Hazazi
10.5120/21557-4570

Abdullah Sheneamer, Ahmed Alharthi, Hanan Hazazi . Two Approaches of Natural Numbers Sorting: TAISN and Improved Array-Indexed Algorithms. International Journal of Computer Applications. 121, 8 ( July 2015), 1-6. DOI=10.5120/21557-4570

@article{ 10.5120/21557-4570,
author = { Abdullah Sheneamer, Ahmed Alharthi, Hanan Hazazi },
title = { Two Approaches of Natural Numbers Sorting: TAISN and Improved Array-Indexed Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { July 2015 },
volume = { 121 },
number = { 8 },
month = { July },
year = { 2015 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume121/number8/21557-4570/ },
doi = { 10.5120/21557-4570 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:07:52.837689+05:30
%A Abdullah Sheneamer
%A Ahmed Alharthi
%A Hanan Hazazi
%T Two Approaches of Natural Numbers Sorting: TAISN and Improved Array-Indexed Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 121
%N 8
%P 1-6
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Data Structure is one of the fundamental areas of the computer science. Sorting is crucial in data structure, which creates the list of sequence items. In this paper, we present two techniques of sorting algorithm for natural numbers, which uses the array indexing methodology and insert that number into the proper index of the array without performing any element comparisons and swapping. The first algorithm improves Array- Indexed Sorting Algorithm for natural numbers [1] by adding negative numbers. The second algorithm is a new sorting algorithm that refers to Two Arrays-Indexed Sorting Algorithm for Natural Numbers (TAISN). The two techniques of sorting algorithm for natural numbers are efficient to give a much better performance than the existing sorting algorithms of the O(n2) class, for large array size with same length of digits of input data.

References
  1. Babu, D. R. , Shankar, R. S. , Kumar, V. P. , Rao, C. S. , Babu, D. M. , Sekhar, V. C. (2011, May). Array-indexed sorting algorithm for natural numbers. In Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on (pp. 606-609). IEEE.
  2. Donald K. The Art of ComputerProgramming, Volume 3: Sorting and Searching, Third Edition. Addison-Wesley, 1997. ISBN 0-201- 89685-0. pp. 106-110 of section 5. 2. 2: Sorting by Exchanging.
  3. Butt, W. H. , Javed, M. Y. (2008, December). A new Relative sort algorithm based on arithmetic mean value. In Multitopic Conference, 2008. INMIC 2008. IEEE International (pp. 374- 378). IEEE.
  4. Seymour Lipschutz. Theory and Problems of Data Structures, Schaum's Outline Series: International Edition, McGraw- Hill, 1986. ISBN 0-07-099130-8. , pp. 324-325, of Section 9. 4:Selection Sort.
  5. Leiserson, C. E. , Rivest, R. L. , Stein, C. (2001). Introduction to algorithms. T. H. Cormen (Ed. ). The MIT press.
  6. Seymour L . Theory and Problems of Data Structures, Schaum's Outline Series: International Edition, McGraw- Hill, 1986. ISBN 0-07099130 8. , pp. 322-323, of Section 9. 3: Insertion Sort.
  7. Hoare, C. A. R. "Partition: Algorithm 63," "Quicksort: Algorithm 64," and "Find: Algorithm 65. " Comm. ACM 4(7), 321- 322, 1961.
  8. Heap Sort. " Wikipedia. Wikimedia Foundation, 30 Nov. 2013. Web. 03 Dec. 2013.
  9. Merge Sort. "Wikipedia. Wikimedia Foundation, 12 Feb. 2013. Web. 03 Dec. 2013
  10. Knuth, D. E. (2006). Art of Computer Programming, Volume 4, Fascicle 4, The: Generating All Trees–History of Combinatorial Generation. Addison-Wesley Professional.
  11. Agarwal, A. , Pardesi, V. , Agarwal, N. , Tech, M. , Tech, C. N. M. , DTU, D. B. , BITS, S. (2013). A New Approach To Sorting: Min-Max Sorting Algorithm. International Journal of Engineering, 2(5).
Index Terms

Computer Science
Information Sciences

Keywords

Sorting Natural Number Sorting.

Powered by PhDFocusTM