Parallel Implementation of Sorting Algorithms

A sorting algorithm is an efficient algorithm, which perform an important task that puts elements of a list in a certain order or arrange a collection of elements into a particular order. Sorting problem has attracted a great deal of research because efficient sorting is important to optimize the use of other algorithms such as binary search. This paper presents a new algorithm that will split large array in sub parts and then all sub parts are processed in parallel using existing sorting algorithms and finally outcome would be merged. To process sub parts in parallel multithreading has been introduced