Both Ended Sorting Algorithm & Performance Comparison with Existing Algorithm

One of the basic areas of the computer science is Data Structure. Sorting is an important issue in Data Structure which creates the sequence of the list of items. Although numbers of sorting algorithms are available, it is all the more necessary to select the best sorting algorithm. Therefore, sorting problem has attracted a great deal of research as sorting technique is very often used in a large variety of important applications so as to arrange the data in ascending or descending order. This paper presents a Both Ended Sorting Algorithm which is faster or better than the bubble sort& others algorithm. After having studied various sorting algorithms; I came to the conclusion that there is no such sorting algorithm which works on the basis of both end comparison right end as well as left end. The new algorithm so is then analysed, implemented & tested. The test results obtained are then presented and compared with the traditional Sorting Algorithm. Worst case complexity is also improved as a compare to bubble sort.