diff --git a/sorting_searching/merge_sort/test_merge_sort.py b/sorting_searching/merge_sort/test_merge_sort.py
index f732279..47daca5 100644
--- a/sorting_searching/merge_sort/test_merge_sort.py
+++ b/sorting_searching/merge_sort/test_merge_sort.py
@@ -1,6 +1,5 @@
 #Like QuickSort, 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.
 
 from nose.tools import assert_equal, assert_raises