ABSTRACT

An important issue in computer science is ordering a list of items. Sorting is the process of putting data in order; either numerically or alphabetically. 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 model that will split large array in sub parts and then all the 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.