Comparison of Sorting Algorithms based on Input Sequences

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.