CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
Implementation of Feature Selection Using Correlation Matrix in Python

Ahmad Farhan AlShammari
Random Articles
Reseach Article

Odd Even Merge Sort based on INDEX

Published on December 2013 by Vuppulanchi Pravalika, K. Ravindra Babu, R. Dileepkumar, M.thirupathi Reddy
journal_cover_thumbnail

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.

@article{
author = { Vuppulanchi Pravalika, K. Ravindra Babu, R. Dileepkumar, M.thirupathi Reddy },
title = { Odd Even Merge Sort based on INDEX },
journal = { Futuristic Areas in Computer Engineering and Technology 2013 },
issue_date = { December 2013 },
volume = { FACET },
number = { 1 },
month = { December },
year = { 2013 },
issn = 0975-8887,
pages = { 21-23 },
numpages = 3,
url = { /proceedings/facet/number1/14690-1320/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 Futuristic Areas in Computer Engineering and Technology 2013
%A Vuppulanchi Pravalika
%A K. Ravindra Babu
%A R. Dileepkumar
%A M.thirupathi Reddy
%T Odd Even Merge Sort based on INDEX
%J Futuristic Areas in Computer Engineering and Technology 2013
%@ 0975-8887
%V FACET
%N 1
%P 21-23
%D 2013
%I International Journal of Computer Applications
Abstract

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.

References
  1. C programming and Data Structures padmanabham BS Publications, 2nd Edition, and ISBN: 81-7800-096-2, page no: 42
  2. C programming and Data Structures E. Bala Guruswamy, Mc GrawHill, ISBN (13):978-0-07-0681163 ISBN (10):0-07-0681163, page no: 19. 1
  3. C programming and Data Structures Behrouz A. Forouzan Richard F. Gilbey, Technological University series, ISBN-13:978:81-315-1268-5 ISBN-10:81-315-1268-1, page no: 758.
  4. Fundamentals of Computing Algorithms, Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, Second Edition, and ISBN 978 81 7371 6126, page no: 478.
  5. http://www. codebeach. com/2008/09/sorting-algorithms-in-c. html
  6. http://epaperpress. com/sortsearch/download/sortsearch. pdf
  7. http://www-users. cselabs. umn. edu/classes/Spring-2010/csci5451/FILES/LecN15. pdf
  8. http://faculty. cs. byu. edu/~ringger/Winter2006-CS312/lectures/lecture39-parallelmergesort. pdf
  9. http://www. iti. fh-flensburg. de/lang/algorithmen/sortieren/networks/oemen. htm
  10. C programming with problem solving J. A. Jones and K. Harrow, dreamtech Press.
  11. Programming in C- Stephen G. Kochan, 3rd Edition, Pearson Education.
  12. C for Engineers and Scientists, H. Cheng, Mc. Graw-Hill International Edition.
  13. C and Data Structures - E V Prasad and N B Venkateshwarlu, S. Chand&Co.
  14. C programming &Data Structures, P. Dey, M Ghosh R Thereja, Oxford University Press.
Index Terms

Computer Science
Information Sciences

Keywords

Odd Even Merge Sort Bubble Sort Selection Sort Insertion Sort Quick Sort Merge Sort