///////
Search

Selection Sort

날짜
2022/09/27
// selection sort 구현 public class HW_0927_1 { public static void main(String[] args) { int[] MainArray = new int[5]; for (int i = 0; i < MainArray.length; i++) { MainArray[i] = (int) (Math.random() * 10) + 1; System.out.print(MainArray[i] + " "); } System.out.println(); selectionSort(MainArray); for (int i = 0; i < MainArray.length; i++) { System.out.print(MainArray[i] + " "); } } static int[] selectionSort(int[] arr) { int min = 0; for (int i = 0; i < arr.length - 1; i++) { for (int j = i; j < arr.length - 1; j++) { if (arr[i] > arr[j + 1]) { min = arr[j + 1]; arr[j + 1] = arr[i]; arr[i] = min; } } } return arr; } }
Java
복사