The week's pick
Random Articles
Reseach Article
Comparison of Sorting Algorithms based on Input Sequences
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 78 - Number 14 |
| Year of Publication: 2013 |
| Authors: Ashutosh Bharadwaj, Shailendra Mishra |
10.5120/13589-1325
|
Ashutosh Bharadwaj, Shailendra Mishra . Comparison of Sorting Algorithms based on Input Sequences. International Journal of Computer Applications. 78, 14 ( September 2013), 7-10. DOI=10.5120/13589-1325
Abstract
Ordering is a very important for mankind . If anything is in unordered then it will not easily understand by anyone but if it is in order then it will easily understand and used by anyone. So ordering is a very important issue in computer science also. In computer science many programming applications use ordering to solving a problem either it is in ascending or descending order. In this paper we discuss four sorting algorithms which are already existed named as Insertion Sort, Bubble Sort, Selection Sort, Merge Sort and we design a new sorting algorithm named as index sort also. In this paper we check the performance and comparison of all five sorting algorithm on the basis of increasing the no of elements in bulk. We check how much processing time is taken by all four sorting algorithms with Index Sort and compared them and finding which sorting algorithm takes less time to sort the elements like 10, 100, 1000, 10000 . If any algorithm takes less processing time it means that it sorts the element faster than others. The processing time of a sorting algorithm is based on the processing speed of a Processor as well as internal memory (RAM) used by the system.
References
- Comparison of Sorting Algorithms (On the Basis of Average Case) Pankaj Sareen.
- A Comparison Based Analysis of Four Different Types of Sorting Algorithms in Data Structures with Their Performances.
- Min-Max Select Bubble Sorting Algorithm.
- CSCE 3110Data Structures & Algorithm Analysis.
- Assortment of different sorting algorithms. Amardeep Singh, Monika, Vandana, Sukhnandan Kaur.
- Robustness versus Performance in Sorting and Tournament Algorithms by Wilfried Elmenreich, Tobias Ibounig, István Fehérvári.
- Seymour Lipschutz (2009) Data Structure with C, Schaum Series, and Tata McGraw-Hill Education.
- Merge sort:- Merge sort algorithm, C. BronTechnological Univ. , Eindhoven, The Netherlands, Communications of the ACM Volume 15 Issue 5, May 1972, ACM New York, NY, USA .
- Review on sorting algorithms A comparative study on two sorting algorithms By Pooja Adhikari.
- An Enhancement of Major Sorting Algorithms Jehad Alnihoud and Rami Mansi.
- Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, fifth Indian printing (Prentice Hall of India private limited), New Delhi-110001
Index Terms
Keywords