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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Cognitive Sorting

Published on July 2012 by Pankaj Kumar G, Prasad J C
journal_cover_thumbnail

Advanced Computing and Communication Technologies for HPC Applications
Foundation of Computer Science USA
ACCTHPCA - Number 3
July 2012
Authors: Pankaj Kumar G, Prasad J C
a3b9abac-3e13-4a17-880f-5bf74da26857

Pankaj Kumar G, Prasad J C . Cognitive Sorting. Advanced Computing and Communication Technologies for HPC Applications. ACCTHPCA, 3 (July 2012), 6-10.

@article{
author = { Pankaj Kumar G, Prasad J C },
title = { Cognitive Sorting },
journal = { Advanced Computing and Communication Technologies for HPC Applications },
issue_date = { July 2012 },
volume = { ACCTHPCA },
number = { 3 },
month = { July },
year = { 2012 },
issn = 0975-8887,
pages = { 6-10 },
numpages = 5,
url = { /specialissues/accthpca/number3/7564-1018/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 Advanced Computing and Communication Technologies for HPC Applications
%A Pankaj Kumar G
%A Prasad J C
%T Cognitive Sorting
%J Advanced Computing and Communication Technologies for HPC Applications
%@ 0975-8887
%V ACCTHPCA
%N 3
%P 6-10
%D 2012
%I International Journal of Computer Applications
Abstract

Sorting or ordering a list of items is one of the tasks that occur frequently in majority of computer programs. In our work we incorporated certain aspects of human cognition into sorting algorithms that will improve their performance. This paper presents two new variants of Selection sort. The first algorithm has a time complexity of O(1) in the best case. The second algorithm outperforms Selection sort and its variants when sorting a list of items that has a large number of duplicates present in it.

References
  1. Demuth, H. 1956. Electronic Data Sorting. PhD thesis, Stanford University.
  2. Astrachanm O. ,2003. Bubble Sort: An Archaeological Algorithmic Analysis, Duk University.
  3. Bender, M. A. , Farach-Colton, M. , and Mosteiro M. 2006. Insertion Sort is O(n log n). Theory of Computing Systems Volume 39, Number 3.
  4. Jehad Alnihoud and Rami Mansi. An Enhancement of Major Sorting Algorithms. The International Arab Journal of Information Technology, Vol. 7, No. 1, January 2010.
  5. Turing, A. M. , 1948, Intelligent machinery.
  6. Man?dziuk, J ,"Towards Cognitively Plausible Game Playing Systems" , IEEE Computational Intelligence Magazine vol. 6 no. 4 pp. 38-51, 2011.
  7. Donald Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89685-0.
  8. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7.
  9. Wikipedia -The free encyclopedia [online] Available: http://en. wikipedia. org/wiki/Sorting_ algorithm.
  10. Nyhoff L. , An Introduction to Data Structures, Nyhoff Publishers, Amsterdam, 2005.
  11. Shahzad B. and Afzal M. , "Enhanced Shell Sorting Algorithm," Computer Journal of Enformatika, vol. 21, no. 6, pp. 66-70, 2007
  12. Shell D. , "A High Speed Sorting Procedure,"Computer Journal of Communications of theACM, vol. 2, no. 7, pp. 30-32, 1959.
Index Terms

Computer Science
Information Sciences

Keywords

Algorithms Bingo Sort Cognition Selection Sort Time Complexity.