Merge sort is a recursive & divide-and-conquer algorithm. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same or related type until ...

This repository contains a Python implementation of the Merge Sort algorithm and two solutions to the connectivity ... The solution is coded into connect.py and is highly inspired on the code proposed ...