diff --git a/Sort/Java/MergeSort.java b/Sort/Java/MergeSort.java
new file mode 100644
index 0000000..6f3441f
--- /dev/null
+++ b/Sort/Java/MergeSort.java
@@ -0,0 +1,70 @@
+import java.util.Arrays;
+
+public class MergeSort {
+
+	public static void main(String a[]) {
+		int[] arr1 = { 9, 14, 3, 2, 43, 11, 58, 22 };
+		System.out.println("Before Sort");
+		for (int i : arr1) {
+			System.out.print(i + " ");
+		}
+		System.out.println();
+
+		sort(arr1, 0, arr1.length-1);// sorting array using insertion sort
+
+		System.out.println("After Sort");
+		for (int i : arr1) {
+			System.out.print(i + " ");
+		}
+	}
+
+
+	public static void sort(int[] array, int leftIndex, int rightIndex) {
+		if (leftIndex < rightIndex) {
+			int mid = (leftIndex + rightIndex) / 2;
+			sort(array, leftIndex, mid);
+			sort(array, mid + 1, rightIndex);
+			merge(array, leftIndex, mid, rightIndex);
+		}
+}
+
+	private static void merge(int[] array, int leftIndex, int mid, int rightIndex) {
+		int i = leftIndex;
+		int j = mid + 1;
+		int k = leftIndex;
+
+		int[] aux = Arrays.copyOf(array, array.length);
+
+		while (i <= mid && j <= rightIndex) {
+			if (aux[i] < (aux[j])) {
+				array[k] = aux[i];
+				i++;
+			} else {
+				array[k] = aux[j];
+				j++;
+			}
+			k++;
+		}
+
+		while (i <= mid) {
+			array[k] = aux[i];
+			i++;
+			k++;
+		}
+
+		while (j <= rightIndex) {
+			array[k] = aux[j];
+			k++;
+			j++;
+		}
+	}
+
+	public static void swap(int[] array, int i, int j) {
+		if (array == null)
+			throw new IllegalArgumentException();
+
+		int temp = array[i];
+		array[i] = array[j];
+		array[j] = temp;
+	}
+}