Parallel computing has emerged as a prominent topic in computer science due to its significant role in achieving high-performance computational solutions. Parallelism has become the preferred approach for accelerating algorithm execution, especially in response to advancements in computer architectures, which now increasingly incorporate multi-core and many-core processors. This paper investigates the educational advantages of visualizing the Parallel Merge Sort algorithm through animation. It also analyzes and compares the time complexities of the traditional Merge Sort algorithm and its parallel counterpart. Furthermore, we demonstrate the implementation of the Parallel Merge Sort algorithm within a real-time, interactive application. To enhance educational effectiveness, we developed an animated application that visually represents the parallel sorting process. The application uses a bar graph to illustrate the dataset before sorting, subsequently applying the sorting algorithm and automatically displaying the sorting process through animation. This research examines how such visualizations contribute to the computer science curriculum, specifically focusing on student learning outcomes. Our findings and user feedback are documented and compared with previous studies in this field