A Novel Sorting Technique to Sort Elements in Ascending Order
Debabrata Swain1, G. Ramkrishna2, Hitesh Mahapatra3, Pramoda Patro4, Pravin M.Dhanrao5
1Prof. Debabrata Swain, Received his B.Tech in Computer Science and Engineering from RIT, Berhampur, India.
2Prof G. Ramakrishna, Received his B.Tech in Computer Science and Engineering from RNEC Ongole, Affliated to JNTU, Hyderabad, India.
3Prof Hitesh Mohapatra, Received his B.Tech in Information Technology from GIET, Gunupur, BPUT, India.
4Prof Pramoda Patro, Received his M.Sc in Mathematics from Khallikote College, Berhampur, India.
5Prof. P. M. Dhanrao, has Completed B.E. From University of Pune, India.
Manuscript received on September 21, 2013. | Revised Manuscript received on October 05, 2013. | Manuscript published on October 30, 2013. | PP: 212-216 | Volume-3, Issue-1, October 2013. | Retrieval Number: A2215103113/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Sorting is an operation to arrange the elements of a data structure in some logical order. In our daily lifes, without knowing about sorting we are doing works in sorted order. So that’s why everybody must need an efficient sorting technique which will solve sorting problem with in limited time. So We have discussed about various existing sorting algorithms with their advantage and disadvantage. In this paper, we have proposed a new sorting algorithm which overcomes some common disadvantage of some traditional existing algorithms by properly utilizing the memory. Here, we have compared our algorithm with traditional existing algorithms by using some factors.
Keywords: Various sorting algorithms. Bubble sort, Selection sort, Insertion sort and Quick sort.