This work was part of MTAT.03.238 course. The goal of this work was to demonstrate the performance advantages of Parallel Computing over Standard (Serial) Computing. To understand the performance difference between parallel and non-parallel environments, we implemented the Quick Sort algorithm in both. We discovered that when implemented efficiently, the parallel approach outperforms the standard (serial) approach. However, if parallel implementation is not done efficiently, it produces poorer results than the serial approach.