added a helper function for easy use

Author: pythonioncoder

MergeSortVis.py

@@ -25,14 +25,14 @@ def display(self):
 		plt.pause(0.0001)
 
 
-def merge_sort(current: Vis, lo, hi):
+def _merge_sort(current: Vis, lo, hi):
 	unsorted = current.lst[lo:hi]
 
 	if len(unsorted) < 2:
 		return unsorted
 
-	left = merge_sort(current, lo, lo + round(len(unsorted)/2)).copy()
-	right = merge_sort(current, lo + round(len(unsorted)/2), hi).copy()
+	left = _merge_sort(current, lo, lo + round(len(unsorted)/2)).copy()
+	right = _merge_sort(current, lo + round(len(unsorted)/2), hi).copy()
 
 	l, r = 0, 0
 	while l < len(left) and r < len(right):
@@ -65,6 +65,10 @@ def merge_sort(current: Vis, lo, hi):
 	return current.lst[lo:hi]
 
 
+def merge_sort(current: Vis):
+	return _merge_sort(current, 0, len(current.lst))
+
+
 if __name__ == '__main__':
 	my_vis = Vis()
-	merge_sort(my_vis, 0, len(my_vis.lst))
+	merge_sort(my_vis)

QuickSortVis.py

@@ -25,7 +25,7 @@ def display(self):
 		plt.pause(0.0001)
 
 
-def quick_sort(current: Vis, lo, hi):
+def _quick_sort(current: Vis, lo, hi):
 	unsorted = current.lst[lo:hi]
 
 	if len(unsorted) < 2:
@@ -61,9 +61,13 @@ def quick_sort(current: Vis, lo, hi):
 		current.display()
 		current.highlights[lo+i], current.highlights[lo+j], current.highlights[lo+pivot_index] = current.barcol, current.barcol, current.barcol
 
-	return quick_sort(current, lo, lo+i) + quick_sort(current, lo+i, hi)
+	return _quick_sort(current, lo, lo+i) + _quick_sort(current, lo+i, hi)
+
+
+def quick_sort(current: Vis):
+	return _quick_sort(current, 0, len(current.lst))
 
 
 if __name__ == '__main__':
 	my_vis = Vis()
-	quick_sort(my_vis, 0, len(my_vis.lst))
+	quick_sort(my_vis)