January 2018
Intermediate to advanced
332 pages
7h 36m
English
Mergesort is a type of divide and conquer sorting algorithm in which the entire dataset is first divided into subsets of one element each—these subsets are then joined and sorted repeatedly until we get one sorted set.
This algorithm uses both recursion and divide and conquer methods. Let's take a look at the pseudo code for such an implementation.
Read now
Unlock full access