Merge pull request geekcomputers#636 from abhi01274/patch-3

Update Merge-sort.py

Author: geekcomputers

Merge-sort.py

@@ -10,7 +10,7 @@
 
 
 def merge_sort(L):
-    mid = int((len(L) - 1) / 2)  # calculated value of middle index of array
+    mid = int((len(L) - 1) / 2)  # calculate the value of middle index of array
 
     if len(L) > mid + 2:  # this loop will run when length of array is greater than 2
         a = merge_sort(L[0:mid])  # a is initialised with left side of the array taking reference as middle index