Samarth Batra

## Description Merge Sort in Python For Example: * Added a file(s) named 'Mergesort.py' that implements 'Merge Sort'. * Changed the algorithm for performance/readablity/bugs. * Added documentation to the algorithm...

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.

### Submission Checklist - [x] Your pull request targets the `master` branch of the repository. - [x] You have only one commit (if not, [squash](http://forum.freecodecamp.org/t/how-to-squash-multiple-commits-into-one-with-git/13231) them into one commit). -...

The longest common subsequence problem is the problem of finding the longest subsequence common to all sequences in a set of sequences