diff --git a/Python/sorting/merge sort.py b/Python/sorting/merge sort.py
new file mode 100644
index 00000000..80ca16b4
--- /dev/null
+++ b/Python/sorting/merge sort.py	
@@ -0,0 +1,26 @@
+def merge_sort(arr):
+    if len(arr) <= 1:
+        return arr
+
+    mid = len(arr) // 2
+    left = merge_sort(arr[:mid])
+    right = merge_sort(arr[mid:])
+
+    return merge(left, right)
+
+
+def merge(left, right):
+    result = []
+    i = j = 0
+
+    while i < len(left) and j < len(right):
+        if left[i] <= right[j]:
+            result.append(left[i])
+            i += 1
+        else:
+            result.append(right[j])
+            j += 1
+
+    result.extend(left[i:])
+    result.extend(right[j:])
+    return result
diff --git a/Python/sorting/quick sort.py b/Python/sorting/quick sort.py
new file mode 100644
index 00000000..9e5e1ec1
--- /dev/null
+++ b/Python/sorting/quick sort.py	
@@ -0,0 +1,19 @@
+def quick_sort(arr):
+    if len(arr) <= 1:
+        return arr[:]
+
+    pivot = arr[0]
+
+    less = []
+    equal = []
+    greater = []
+
+    for x in arr:
+        if x < pivot:
+            less.append(x)
+        elif x == pivot:
+            equal.append(x)
+        else:
+            greater.append(x)
+
+    return quick_sort(less) + equal + quick_sort(greater)