Search for Articles:

MECS Press Menu

Monica Maurya

Work place: Department of Computer Science and Engineering Kamla Nehru Institute of Technology Sultanpur, Uttar Pradesh

E-mail: monicamaurya90@yahoo.co.in

Website:

Research Interests: FFT Algorithms, Data Structures and Algorithms, Analysis of Algorithms, Randomized Algorithms, Programming Language Theory

Biography

Monica Maurya is pursuing M.Tech (CSE) from Kamla Nehru Institute Of Technology, Sultanpur, India. She has completed her graduation in B.Tech (CSE) from IIMT College Of Engineering, Greater Noida affiliated to Gautam Buddh Technical University, Lucknow, India in 2011.
After that she has worked as a Guest Lecturer in Department Of Computer Science and Engineering in Kamla Nehru Institute Of Technology, Sultanpur, India from the duration July 2012 to May 2014. After this period of teaching she has worked as a Guest Lecturer in Department Of Information Technology in Rajkiya Engineering college, Ambedkar Nagar, India from July2014 to January 2016.
Her areas of interest is towards algorithms, programming. She will do her best to continue practice and improving her knowledge and experiences in her areas. Hoping to do the better works in future.

Author Articles
An Approach to Parallel Sorting Using Ternary Search

By Monica Maurya Alka Singh

DOI: https://doi.org/10.5815/ijmecs.2018.04.05, Pub. Date: 8 Apr. 2018

This paper describe a parallel sorting algorithm which is the combination of counting sort and ternary search. The proposed algorithm is based on split and concurrent selection strategy. First of all the data sequence is distributed among the different processors and are sorted in parallel using counting sort. Then it applies ternary search to find the index position of all elements globally to find the correct position of each elements in data sequence. This paper analyses the computational complexity of proposed parallel sorting algorithm and compares it with some of existing algorithms. The results of proposed algorithms shows that it is better than existing parallel sorting algorithm like parallel merge sort and binary search based sorting algorithm.

[...] Read more.
Other Articles

Subscribe to receive issue release notifications and newsletters from MECS Press journals