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

A Novel Sorting Algorithm and Comparison with Bubble sort and Insertion sort

by Nitin Arora, Suresh Kumar, Vivek Kumar Tamta
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 45 - Number 1
Year of Publication: 2012
Authors: Nitin Arora, Suresh Kumar, Vivek Kumar Tamta
10.5120/6746-8940

Nitin Arora, Suresh Kumar, Vivek Kumar Tamta . A Novel Sorting Algorithm and Comparison with Bubble sort and Insertion sort. International Journal of Computer Applications. 45, 1 ( May 2012), 31-32. DOI=10.5120/6746-8940

@article{ 10.5120/6746-8940,
author = { Nitin Arora, Suresh Kumar, Vivek Kumar Tamta },
title = { A Novel Sorting Algorithm and Comparison with Bubble sort and Insertion sort },
journal = { International Journal of Computer Applications },
issue_date = { May 2012 },
volume = { 45 },
number = { 1 },
month = { May },
year = { 2012 },
issn = { 0975-8887 },
pages = { 31-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume45/number1/6746-8940/ },
doi = { 10.5120/6746-8940 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:36:31.870836+05:30
%A Nitin Arora
%A Suresh Kumar
%A Vivek Kumar Tamta
%T A Novel Sorting Algorithm and Comparison with Bubble sort and Insertion sort
%J International Journal of Computer Applications
%@ 0975-8887
%V 45
%N 1
%P 31-32
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Sort is an algorithm that arranges all elements of an array, orderly. Sorting Technique is frequently used in a large variety of important applications to arrange the data in ascending or descending order. Several Sorting Algorithms of different time and space complexity are exist and used. This paper provides a novel sorting algorithm Counting Position sort which is based on counting the position of each element in array. We also compare Counting Position algorithm with Bubble sort and Selection sort. We have used the MATLAB for implementation and Analysis of CPU time taken for all the three sorting algorithms used. We have checked the algorithms with random input sequence of length 10, 100, 1000, 10000, 50000. Result shows that for the small length of input sequence the performance all the three techniques is all most same, but for the large input sequence Selection sort is faster than Bubble sort and Counting Position sort.

References
  1. Herbert Schildt Tata McGraw-Hill
  2. , "The Complete Reference C fourth Edition".
  3. Alfred V. , Aho J. , Horroroft, Jeffrey D. U. (2002) Data Structures and Algorithms.
  4. Frank M. C. (2004) Data Abstraction and Problem Solving with C++. US: Pearson Education, Inc.
  5. Cormen T. H. , Leiserson C. E. , Rivest R. L. and Stein C. (2003) Introduction to Algorithms MIT Press, Cambridge, MA, 2nd edition.
  6. Seymour Lipschutz (2009) Data Structure with C, schaum Series, Tata McGraw-Hill Education.
Index Terms

Computer Science
Information Sciences

Keywords

Bubble Sort Counting Position Sort Selection Sort Sorting

Powered by PhDFocusTM