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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Position Sort

by Anuj Kumar, Mamta
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 53 - Number 5
Year of Publication: 2012
Authors: Anuj Kumar, Mamta
10.5120/8420-1648

Anuj Kumar, Mamta . Position Sort. International Journal of Computer Applications. 53, 5 ( September 2012), 30-35. DOI=10.5120/8420-1648

@article{ 10.5120/8420-1648,
author = { Anuj Kumar, Mamta },
title = { Position Sort },
journal = { International Journal of Computer Applications },
issue_date = { September 2012 },
volume = { 53 },
number = { 5 },
month = { September },
year = { 2012 },
issn = { 0975-8887 },
pages = { 30-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume53/number5/8420-1648/ },
doi = { 10.5120/8420-1648 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:53:22.705918+05:30
%A Anuj Kumar
%A Mamta
%T Position Sort
%J International Journal of Computer Applications
%@ 0975-8887
%V 53
%N 5
%P 30-35
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Computer science has many important concepts which are used at a very large scale. It is frequently used by the real life and system applications. Sorting is one of the most important concepts in computer science. Through this paper, we are present a new concept of sorting named "Position Sort" which improves the sorting algorithm by reducing the swapping operation, which directly effects and improve the running time of algorithm. We solve the problem of sorting by various methods. Some methods are very complex to implement. The concept of position sort is very efficient and easy to implement. It increases the efficiency of problem by reducing the swapping operations. This algorithm uses the basic idea of sorting and produces the result. It places an element at their right position by a single swapping only.

References
  1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. "Introduction to Algorithms" MIT Press, Cambridge, MA, 3rd edition,
  2. Frank MC (2004). Data Abstraction and Problem Solving with C++. US: Pearson Education, Inc .
  3. Robert S (1998). Algorithms in C. Addison-Wesley Publishing Company, Inc.
  4. Box R. and Lacey S. , "A Fast Easy Sort," Computer Journal of Byte Magazine 1991.
  5. Knuth E. , The Art of Computer Programming Sorting and Searching, Addison Wesley, 1998.
  6. Flores, I. "Analysis of Internal Computer Sorting". J. ACM 7, 4 (Oct. 1960),
  7. Soubhik Chakraborty, Mausumi Bose, and Kumar Sushant, A Research thesis, On Why Parameters of Input Distributions Need be Taken Into Account For a More Precise Evaluation of Complexity for Certain Algorithms.
  8. Lipschutz, "Data Structure with C"schaum Series, Tata McGraw-Hill Education.
  9. V. Estivill-Castro and D. Wood. "A Survey of Adaptive Sorting Algorithms", Computing Surveys,
  10. Williams, J. W. J. "Algorithm 232: Heap sort". Comm. ACM 7, 6.
  11. ANDERSSON, A. and NILSSON, S. 1994. "A New Efficient Radix Sort". In the Proceeding of the 35 Annual IEEE Symposium on Foundation of Computer Science (1994).
Index Terms

Computer Science
Information Sciences

Keywords

Complexity Swapping Bubble Sort Running Time

Powered by PhDFocusTM