Parallel Merge Sort

In my second post I am going to talk about the popular sorting algorithm Merge Sort. The serial implementation of Merge Sort, is based on a divide and conquer approach. The data set is divided into recursively into smaller and smaller parts, i.e. the divide part, and then to conquer the data, the data is … Continue reading Parallel Merge Sort