diff --git a/java/Bubble_Sort.java b/java/Bubble_Sort.java
new file mode 100644
index 0000000..8c94af2
--- /dev/null
+++ b/java/Bubble_Sort.java
@@ -0,0 +1,13 @@
+public class BubbleSort {
+    public static void bubbleSort(int[] array){
+        for (int i = array.length-1; i >0; i--) {
+            for (int j = 0; j < i; j++) {
+                if (array[j]>array[j+1]){
+                    int temp = array[j];
+                    array[j]=array[j+1];
+                    array[j+1]=temp;
+                }
+            }
+        }
+    }
+}
\ No newline at end of file
diff --git a/java/Insertion_Sort.java b/java/Insertion_Sort.java
new file mode 100644
index 0000000..911545c
--- /dev/null
+++ b/java/Insertion_Sort.java
@@ -0,0 +1,13 @@
+public class InsertionSort {
+    public static void insertionSort(int[] array) {
+        for (int i = 1; i < array.length; i++) {
+            int temp = array[i];
+            int j =i-1;
+            while (j>-1 && temp<array[j]){
+                array[j+1]=array[j];
+                array[j]=temp;
+                j--;
+            }
+        }
+    }
+}
\ No newline at end of file
diff --git a/java/MergeSort.java b/java/MergeSort.java
new file mode 100644
index 0000000..8992392
--- /dev/null
+++ b/java/MergeSort.java
@@ -0,0 +1,48 @@
+
+import java.util.Arrays;
+
+public class MergeSort {
+
+    public static int[] merge(int[] array1, int[] array2){
+        int[] combined=new int[array1.length+ array2.length];
+        int index=0;
+        int i=0;
+        int j=0;
+
+        while (i< array1.length && j< array2.length){
+            if (array1[i]<array2[j]){
+                combined[index]=array1[i];
+                index++;
+                i++;
+            }else {
+                combined[index]=array2[j];
+                index++;
+                j++;
+            }
+        }
+        while (i< array1.length){
+            combined[index]=array1[i];
+            index++;
+            i++;
+        }
+        while (j< array2.length){
+            combined[index]=array2[j];
+            index++;
+            j++;
+        }
+        return combined;
+    }
+
+    public static int[] mergeSort(int[] array){
+        if (array.length==1)return array;
+        int mid = array.length/2;
+        int[] left = Arrays.copyOfRange(array,0,mid);
+        int[] right = Arrays.copyOfRange(array,mid,array.length);
+        return merge(mergeSort(left),mergeSort(right));
+    }
+
+    public static void main(String[] args) {
+        int[] array={45,67,23,89,32,55,23,66,34,2};
+        System.out.println(Arrays.toString(mergeSort(array)));
+    }
+}
\ No newline at end of file
diff --git a/java/SelectionSort.java b/java/SelectionSort.java
new file mode 100644
index 0000000..baedddd
--- /dev/null
+++ b/java/SelectionSort.java
@@ -0,0 +1,18 @@
+
+public class SelectionSort {
+    public static void selectionSort(int[] array) {
+        for (int i = 0; i < array.length; i++) {
+            int minIndex=i;
+            for (int j = i+1; j < array.length; j++) {
+                if (array[j]<array[minIndex]){
+                    minIndex=j;
+                }
+            }
+            if (i!=minIndex){
+                int temp = array[i];
+                array[i]=array[minIndex];
+                array[minIndex]=temp;
+            }
+        }
+    }
+}
\ No newline at end of file