GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — java-basics/java-programs/SelectionSort.java at master · learning-zone/java-basics Expand file tree/ Copy pathSelectionSort.javaMore file actions 32 lines (28 loc) · 693 Bytes / Copy pathSelectionSort.javaFile metadata and controls32 lines (28 loc) · 693 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 package misc; public class SelectionSort { public static void doSelectionSort(int[] arr) { for (int i = 0; i < arr.length - 1; i++) { int index = i; for (int j = i + 1; j < arr.length; j++) { if (arr[j] < arr[index]) { index = j; } } int smallerNumber = arr[index]; arr[index] = arr[i]; arr[i] = smallerNumber; } System.out.println("\n\nArray after sort"); for (int element : arr) { System.out.print(element + ", "); } } public static void main(String[] args) { int[] arr1 = { 10, 34, 2, 56, 7, 67, 88, 42 }; System.out.println("Array before sort"); for (int i : arr1) { System.out.print(i + ", "); } doSelectionSort(arr1); } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |