Research Article

Sign Shuffle Sorting Algorithm (S3 Algorithm)

by  Ajay Kedia, Shagun Dhingra
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 148 - Issue 9
Published: Aug 2016
Authors: Ajay Kedia, Shagun Dhingra
10.5120/ijca2016911287
PDF

Ajay Kedia, Shagun Dhingra . Sign Shuffle Sorting Algorithm (S3 Algorithm). International Journal of Computer Applications. 148, 9 (Aug 2016), 19-22. DOI=10.5120/ijca2016911287

                        @article{ 10.5120/ijca2016911287,
                        author  = { Ajay Kedia,Shagun Dhingra },
                        title   = { Sign Shuffle Sorting Algorithm (S3 Algorithm) },
                        journal = { International Journal of Computer Applications },
                        year    = { 2016 },
                        volume  = { 148 },
                        number  = { 9 },
                        pages   = { 19-22 },
                        doi     = { 10.5120/ijca2016911287 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2016
                        %A Ajay Kedia
                        %A Shagun Dhingra
                        %T Sign Shuffle Sorting Algorithm (S3 Algorithm)%T 
                        %J International Journal of Computer Applications
                        %V 148
                        %N 9
                        %P 19-22
                        %R 10.5120/ijca2016911287
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

In computer Science, Sorting algorithm is used to place the elements in a certain order or to arrange the data of the array or string in a particular order. Sorted Data has been used to design the database which contains the array values in a certain order. Typically, Sorting Algorithm is used to arrange the data either in increasing order to decreasing order. There are certain types of sorting algorithm which are used to sort an array and have different cost and time complexity but we have discussed only new sorting algorithms designed by us. Comparison of our sorting algorithm with others sorting algorithm are done in this paper. Because sorting is important to optimize the use of other algorithms in computer science such as binary search or linear search, it has been the subject of extensive research in computer science, and some complexity methods have been developed.

References
  • Lavore, Robert, arrays, Big O Notation and simple sorting. Data structure and algorithms in Java (2nd edition)
  • Simple algorithm example. http://www.cs.cmu.edu/_adamchik/15-121/lectures/Sorting%20Algorithms/sorting.html
  • Wikipedia, the free encyclopedia. Online: Sorting algorithms. http://en.wikipedia.org/wiki/Sortingalgorithms
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Sorting Shuffling Sign Swapping Exchanging Divide Processors.

Powered by PhDFocusTM