Merge Sort - Implementation in Python

Merge Sort(Python) explained with a strong Italian accent. Enjoy.

[Algorithm’s brief description]
Merge sort is a classic divide-and-conquer algorithm. The recursive approach used to sorting involves partitioning the elements into two groups, sorting each of the smaller problems recursively, and then interleaving the two sorted lists to totally order the elements.

[Merge Sort’s applications]
Linked List Sorting, Inversion Count Problem, Data Sorting in Secondary Memory

[Complete code]

[Software]
PyCharm by JetBrains

[Bibliography]