@@ -49,7 +49,7 @@ def sort(_list):
 return merge(a, b)
 
 from itertools import zip_longest
-def sorti(_list):
+def sorti(_list, verbose=True):
 """
 Function to sort an array
 using merge sort algorithm, iteratively
@@ -60,7 +60,7 @@ def sorti(_list):
 # breakdown every element into its own list
 series = [[i] for i in _list]
 while len(series) > 1:
-print(series)
+if verbose: print(series)
 # iterator to handle two at a time in the zip_longest below
 isl = iter(series)
 series = [

@@ -122,7 +122,7 @@ class TestMergeSortIterative(unittest.TestCase, TestSortingAlgorithm):
 
 @staticmethod
 def sort(arr):
-return merge_sort.sorti(arr)
+return merge_sort.sorti(arr, verbose=False)
 
 class TestQuickSort(unittest.TestCase, TestSortingAlgorithm):
 inplace = False