An Approach to Parallel Sorting Using Ternary Search
Monica Maurya, Alka Singh · International Journal of Modern Education and Computer Science · 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.