diff --git a/Merge Sort b/Merge Sort
new file mode 100644
index 0000000..294dee7
--- /dev/null
+++ b/Merge Sort	
@@ -0,0 +1,4 @@
+Think of it as a recursive algorithm continuously splits the array in half until it cannot be further divided. 
+This means that if the array becomes empty or has only one element left, the dividing will stop, i.e. it is the base case to stop the recursion. 
+If the array has multiple elements, split the array into halves and recursively invoke the merge sort on each of the halves. Finally, when both halves are sorted, the merge operation is applied. 
+Merge operation is the process of taking two smaller sorted arrays and combining them to eventually make a larger one.