diff --git a/Sort/Java/Bubble Sort.java b/Sort/Java/Bubble Sort.java
new file mode 100644
index 0000000..813dad8
--- /dev/null
+++ b/Sort/Java/Bubble Sort.java	
@@ -0,0 +1,37 @@
+import java.util.*;
+
+public class tester {
+	
+	//function that takes input array and its size and prints sorted form
+	public static void bubble(int [] arr,int n){
+		
+	//iterating over the array in typical bubble sort fashion swapping wherever needed to get sorted array	
+		for(int j=0;j<n;j++){
+			for(int k=j+1;k<n;k++){
+				if(arr[j]>arr[k]){
+					int temp=arr[j];
+					arr[j]=arr[k];
+					arr[k]=temp;
+				}
+			}
+		}
+		System.out.println("Sorted array is");
+		for(int j=0;j<n;j++){
+			System.out.print(arr[j]+" ");
+		}
+	}
+	public static void main(String[] args) {
+		
+		Scanner sc= new Scanner (System.in);
+			
+			System.out.println("Element array is 5, 3, 2, 6, 7, 9");
+			
+			int[] arr=new int[5, 3, 2, 6, 7, 9];
+			for(int j=0;j<n;j++){
+				arr[j]=sc.nextInt();
+			}
+			
+			bubble(arr,n);
+	}
+
+}
diff --git a/Sort/Java/Selection Sort.java b/Sort/Java/Selection Sort.java
new file mode 100644
index 0000000..ffddccd
--- /dev/null
+++ b/Sort/Java/Selection Sort.java	
@@ -0,0 +1,20 @@
+public static void main(String[] args) {
+    int[] data = {6,3,17,8,4,7,2,28};
+    int tampung = 0;
+    for (int x = 0; x < data.length; x++) {
+        for (int y = x + 1; y < data.length; y++) {
+            System.out.println("\nmembandingkan "+data [x] + " dengan " + data[y]);
+            System.out.print("awalnya data[x] adalah" + data[x] + "lalu");
+                
+            if (data[x] > data[y]) {
+                tampung = data[x];
+                data[x] = data[y];
+                data[y] = tampung;
+                System.out.print("data[x] menjadi " + data[x] +", data[y] menjadi " + data[y] +"."); 
+            }
+            else{
+                System.out.print("data[x] tidak ditukar karena tidak memenuhi kondisi if dan data[y] berlanjut");
+            }
+        }   
+    }
+}