icp2moduleII - gracesyl/big-data-hadoop GitHub Wiki

Scala merge:

Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. The merge () function is used for merging two halves. The merge (arr, l, m, r) is key process that assumes that arr[l..m] and arr[m+1..r] are sorted and merges the two sorted sub-arrays into one.

How the sorting and merging works logic was clearly explained here.

Here how the output comes:

BFS:

Breadth First Search:

Bonus: Depth First Search