diff --git a/Grade 10/Computer Science/ICS4U1/Sorting Methods/Merge Sort.md b/Grade 10/Computer Science/ICS4U1/Sorting Methods/Merge Sort.md
new file mode 100644
index 0000000..2b6ddcf
--- /dev/null
+++ b/Grade 10/Computer Science/ICS4U1/Sorting Methods/Merge Sort.md	
@@ -0,0 +1,4 @@
+## Introduction
+Merge sort is a comparison type sort that has an effective use of recursion and the divide and conquer algorithm. 
+Merge sort sorts in O(N log N) time and uses O(N log N) space.We will explore the pros and cons of this sort, 
+the proofs on its time and space complexity and the implementation and algorithm of this sorting method.
\ No newline at end of file