Create SelectionSort.java

Selection Sort is a simple, comparison-based sorting algorithm. It works by dividing the input list into two parts: a sorted and an unsorted section. The algorithm repeatedly selects the smallest (or largest, depending on the order) element from the unsorted section and swaps it with the first unsorted element, effectively growing the sorted section one element at a time.

Java/SelectionSort.java

@@ -0,0 +1,39 @@
+public class SelectionSort {
+
+    public static void selectionSort(int[] array) {
+        int n = array.length;
+
+        // Traverse through all array elements
+        for (int i = 0; i < n - 1; i++) {
+            // Find the minimum element in unsorted array
+            int minIndex = i;
+            for (int j = i + 1; j < n; j++) {
+                if (array[j] < array[minIndex]) {
+                    minIndex = j;
+                }
+            }
+            // Swap the found minimum element with the first element
+            int temp = array[minIndex];
+            array[minIndex] = array[i];
+            array[i] = temp;
+        }
+    }
+
+    public static void main(String[] args) {
+        int[] array = {64, 25, 12, 22, 11};
+        System.out.println("Original array:");
+        printArray(array);
+
+        selectionSort(array);
+
+        System.out.println("Sorted array:");
+        printArray(array);
+    }
+
+    static void printArray(int[] array) {
+        for (int value : array) {
+            System.out.print(value + " ");
+        }
+        System.out.println();
+    }
+}