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

Find and Place Sorting Technique for Unique Numbers

by Vishweshwarayya C. Hallur, Ravindra S. Hegadi, S. P. Sajjan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 53 - Number 16
Year of Publication: 2012
Authors: Vishweshwarayya C. Hallur, Ravindra S. Hegadi, S. P. Sajjan
10.5120/8503-2154

Vishweshwarayya C. Hallur, Ravindra S. Hegadi, S. P. Sajjan . Find and Place Sorting Technique for Unique Numbers. International Journal of Computer Applications. 53, 16 ( September 2012), 6-8. DOI=10.5120/8503-2154

@article{ 10.5120/8503-2154,
author = { Vishweshwarayya C. Hallur, Ravindra S. Hegadi, S. P. Sajjan },
title = { Find and Place Sorting Technique for Unique Numbers },
journal = { International Journal of Computer Applications },
issue_date = { September 2012 },
volume = { 53 },
number = { 16 },
month = { September },
year = { 2012 },
issn = { 0975-8887 },
pages = { 6-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume53/number16/8503-2154/ },
doi = { 10.5120/8503-2154 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:54:14.525538+05:30
%A Vishweshwarayya C. Hallur
%A Ravindra S. Hegadi
%A S. P. Sajjan
%T Find and Place Sorting Technique for Unique Numbers
%J International Journal of Computer Applications
%@ 0975-8887
%V 53
%N 16
%P 6-8
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

To perform searching operation we have different kinds of searching techniques. These all searching algorithms works on data, which are previously sorted. An efficient algorithm is required to make searching fast and efficient. This paper presents a new sorting algorithm named as "Find and Place Sorting Technique for Unique Numbers (FPSTUN)". This FPSTUN is designed to perform sorting quickly and easily and also efficient as existing algorithms in sorting.

References
  1. Hore, C. A. R. "Algorithm 64: Quick sort". Comm. ACM 4,7(July 1961), 321.
  2. Soubhik Chakraborty, Mousami Bose, and Kumar Sushant, A research thesis, On way Parameters of input Distributions Need be Taken Into Account For a more precise Evalution of complexity for certain Algorithms.
  3. J. L. Bentley and R. Sedgewick. "Fast Algorithm for Sorting and Searching Strings" ACM-SIAM SODA 97, 360-369,1997.
  4. D. S. Malik, C++ Programming: Program Design including Data Structures, Course Technology (Thomson Learning), 2002, www. course. com
  5. D. Jim enez-Gonz'alez, J. Navarvo, and Larriba-Pay. CC-Radix: "A catch conscious sorting based on Radix sort". In Euromicro Conference on Parallel Distributed and Network based Processing. Pages 101-108, February 2003.
Index Terms

Computer Science
Information Sciences

Keywords

Algorithm Sorting FPSTUN

Powered by PhDFocusTM