public class Test001 {
public static void main(String[] args) {
int[] arr = {3, 5, 1, 9, 7};
Arrays.sort(arr);
for(int i : arr)
System.out.print(i + " ");
System.out.println();
System.out.println(Arrays.toString(arr));
}
}
정렬 알고리즘 : 선택정렬, 버블정렬, 삽입정렬, 퀵정렬, 병합정렬, .....
Arrays.sort는 퀵정렬
import java.util.Arrays; //선택정렬
public class Test001 {
public static void main(String[] args) {
int[] arr = {3, 5, 1, 9, 7};
int i, j, least, temp;
System.out.println(Arrays.toString(arr));
for(i=0; i<arr.length-1; i++) {
least = i;
for(j=i+1; j<arr.length; j++)
if(arr[j] < arr[least])
least = j;
temp = arr[i];
arr[i] = arr[least];
arr[least] = temp;
}
System.out.println(Arrays.toString(arr));
}
}
댓글 없음:
댓글 쓰기