Futuristic Areas in Computer Engineering and Technology 2013 |
Foundation of Computer Science USA |
FACET - Number 1 |
December 2013 |
Authors: Vuppulanchi Pravalika, K. Ravindra Babu, R. Dileepkumar, M.thirupathi Reddy |
dc44a51c-c466-4860-98a4-e7d8f6499831 |
Vuppulanchi Pravalika, K. Ravindra Babu, R. Dileepkumar, M.thirupathi Reddy . Odd Even Merge Sort based on INDEX. Futuristic Areas in Computer Engineering and Technology 2013. FACET, 1 (December 2013), 21-23.
There are various number of sorting techniques that are used to sort 'n' numbers but time complexity is high in some sorting techniques. The main theme of this paper is to sort a set of given numbers in an effective manner. Using Odd Even Merge Sort the time taken to sort given 'n' numbers will be less. Index will be initially assigned to given numbers, based on the index, the numbers will be shuffled and sorted.