July 2018
Beginner
202 pages
5h 4m
English
Scenario
Merge sorting is one of the fastest sorting techniques. It is used in many bundled libraries and APIs. In this activity, we will write an algorithm in Java to sort an array using merge sort.
Aim
To use the pseudocode shown in this section to implement the full merge sort algorithm in Java.
Prerequisites
To solve this activity, you have to implement the methods found in the following class, which is available on the GitHub repository for the book at the following path:
Read now
Unlock full access