diff --git a/JAVA/Selection Sort.java b/JAVA/Selection Sort.java
new file mode 100644
index 0000000..bd92033
--- /dev/null
+++ b/JAVA/Selection Sort.java	
@@ -0,0 +1,34 @@
+import java.util.*;
+class Main 
+{ 
+    static void sel_sort(int numArray[]) 
+    { 
+        int n = numArray.length; 
+   
+        // traverse unsorted array 
+        for (int i = 0; i < n-1; i++) 
+        { 
+            // Find the minimum element in unsorted array 
+            int min_idx = i; 
+            for (int j = i+1; j < n; j++) 
+                if (numArray[j] < numArray[min_idx]) 
+                    min_idx = j; 
+   
+            // swap minimum element with compared element  
+            int temp = numArray[min_idx]; 
+            numArray[min_idx] = numArray[i]; 
+            numArray[i] = temp; 
+        } 
+    } 
+   
+    public static void main(String args[]) 
+    { 
+        //declare and print the original array
+        int numArray[] = {7,5,2,20,42,15,23,34,10};
+        System.out.println("Original Array:" + Arrays.toString(numArray)); 
+        //call selection sort routine
+        sel_sort(numArray); 
+        //print the sorted array
+        System.out.println("Sorted Array:" + Arrays.toString(numArray)); 
+    } 
+}