kingsubin

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 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 package me.kingsubin.studyrepo.book.algorithm.section5; public class QuickSort { public static void main(String[] args) { int[] A = {15, 22, 13, 27, 12, 10, 20, 25, 32}; System.out.println("주어진 배열"); print(A); quickSort(A, 0..

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 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 package me.kingsubin.studyrepo.book.algorithm.section5; public class findMaxMin { public static void main(String[] args) { int[] A = {24, 75, 92, 83, 61, 48, 97, 50}; int[] answer; answer = findMaxMin(A, 0, A.length - 1); System.out.println("Min: " + answer[0]..