Menu Close

Parallel Merge Sort – implement a classic sorting algorithm utilising concurrency Distributed System, Sorting Algorithm, Distributed System

Share this:  

The aim of our project was to implement a classic sorting algorithm utilizing concurrency. We decided on Merge Sort because of its inherent parallelism. Sorting in general has been hailed as a cornerstone in Computer Science [SHG09], as many computer algorithms rely heavily upon it. Such an algorithm is for example the classic Kruskal algorithm for constructing a minimum spanning tree of an undirected graph [Kru56]. Merge Sort is based on the popular Divide-and-conquer approach [CLR02], where the problem at hand is broken into smaller problems of similar nature, which are in turn solved recursively, and the solutions are then combined.

 

Parallel_Merge_Sort Parallel Merge Sort

Anthony-Claret Onwutalobi

Anthony-Claret is an author, entrepreneur, and founder of Codewit Global Network. He is also the publisher of Codewit.com & Igbopeople.org, where he curates and manages content across various domains. With a background in Software Engineering, he has held diverse roles, including Business Analyst, Software Developer, Digital Marketing Consultant, Graphic/Web Designer, Education Counselor, and Software Tester.

Beyond his professional expertise, Mr. Claret is a dedicated writer, activist, and humanitarian. He is a Pan-Africanist and a strong advocate for social justice, equality, and human rights. His passion for technology and digital innovation drives his work, making him an influential administrator, technology enthusiast, and social media strategist. An all-around digital visionary, he continues to contribute meaningfully to discussions on global development, human rights, and technological advancement.

External Link for Anthony-Claret Onwutalobi

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.