Hams, parallel average partitioning and sorting algorithm

Sorting is a vital operation in computer science. Sequential sorting algorithms consume much time with large data, so many attempts are headed to make these algorithms working in parallel but the main obstacle is how to divide the given data into equal partitions to achieve resource utilization and load balance in all processes and consume less time with load balance. This paper presents a new parallel partitioning algorithm which uses dividing large list of numbers into approximately equal partitions better than any other partitioning algorithms and then use quicksort algorithm to sort these parts in parallel depending on the average.