Back-forth sorting algorithm analysis and applications perspective
Sweetesh Singh, Tarun Tiwari, Rupesh Srivastava, Suneeta Agarwal · 2009
Sorting is a very well known problem in computer science. It means arranging the data in either increasing or decreasing order. Here we present a new comparison based sorting algorithm whose complexity is theoretically shown to be O(n2).However graphs of total time taken by different sorting algorithms confirms the superiority of our algorithm over other existing similar algorithms. We have also proved the correctness of the proposed algorithm. The logic of this algorithm can be used for searching efficiently in a two dimensional array.