Added Merge and Quick Sort functionality

Author: pythonioncoder

MergeSort.py

@@ -0,0 +1,20 @@
+def merge_sort(unsorted):
+	if len(unsorted) < 2:
+		return unsorted
+
+	left = unsorted[:len(unsorted)//2]
+	right = unsorted[len(unsorted)//2:]
+	result = []
+
+	left = merge_sort(left)
+	right = merge_sort(right)
+
+	while len(left) > 0 and len(right) > 0:
+		if left[0] < right[0]:
+			result.append(left.pop(0))
+		else:
+			result.append(right.pop(0))
+	result += left
+	result += right
+
+	return result

QuickSort.py

@@ -0,0 +1,26 @@
+import statistics
+
+
+def quick_sort(unsorted):
+	if len(unsorted) < 2:
+		return unsorted
+
+	pivot = statistics.median([unsorted[0], unsorted[len(unsorted)//2], unsorted[-1]])
+	i = -1
+	j = len(unsorted)
+	while True:
+		i += 1
+		j -= 1
+		while unsorted[i] < pivot:
+			i += 1
+		while unsorted[j] > pivot:
+			j -= 1
+
+		if j <= i:
+			break
+
+		temp = unsorted[i]
+		unsorted[i] = unsorted[j]
+		unsorted[j] = temp
+
+	return quick_sort(unsorted[:i]) + quick_sort(unsorted[i:])