^{a}, Syed Tarif Abbas Rizvi

^{b}, Faisal Haseen

^{c}and Kamendra Singh Yadav

^{d}

^{}Department of Computer Science and Engineering, Invertis University, Bareilly, Uttar Pradesh, India.

^{a}Zubair.762001@gmail.com

^{b}tarifabbas786110@gmail.com

^{c}faisalhaseen31@gmail.com

^{d}kamendrasinghyadav@gmail.com

Quick Sort algorithm is widely used in data processing systems because of its fast speed, high efficiency and scientific structure. Its popularity is due to is asymptotically optimal average behavior of Φ(nlogn) [1]. With the advancement in parallel processing, parallel sorting algorithm has become an important area for research. A large number of parallel sorting algorithms have been proposed [3]. Parallel sort is one such parallel quick sort algorithm applied on a Hypercube network. This paper talks about the inefficiency of parallel sort and proposed a new algorithm to overcome that inefficiency.