C Programming For Beginners | Learn C Programming | C Tutorial For Beginners | Edureka

1. Initialize an unsorted array of elements to be sorted.2. Compare each element in the array with its next following element (i + 1).3. If the smaller element is at a lower index than the current element, swap them.4. Repeat step 2 until no more swaps are needed.Here's an example of how Selection Sort works:Suppose we have an unsorted array of elements: [20, 12, 10, 15, 2].We start by comparing the first element (20) with the second element (12). Since 12 is smaller than 20, we swap them. Now the array looks like this: [12, 20, 10, 15, 2].Next, we compare the second element (12) with the third element (10). Since 12 is larger than 10, there is no swap. The array now looks like this: [12, 20, 10, 15, 2].We continue comparing each element in the array with its next following element until no more swaps are needed. After several iterations, the array is sorted in ascending order: [2, 10, 12, 15, 20].In Java, we can implement Selection Sort like this:```javapublic class SelectionSort { public static void sort(int[] arr) { int n = arr.length; // Compare each element with its next following element for (int i = 0; i < n - 1; i++) { int min = i + 1; // Swap the smaller element with the current element if (arr[min] < arr[i]) { swap(arr, i, min); } } } public static void swap(int[] arr, int i, int j) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; }}```To use this implementation, simply call the `sort()` method on an array of integers, like this:```javaint[] arr = {20, 12, 10, 15, 2};SelectionSort.sort(arr);```This will sort the array in ascending order.