[알고리즘 #3] 정렬 기초 다지기

1. 오름차순 정렬

import java.util.*;

public class Main {
	public static void main(String[] args) {
		int[] A = {5, 4, 2, 3, 1};
		Arrays.sort(A);
		System.out.println(Arrays.toString(A));
	}
}

2. 내림차순 정렬

import java.util.*;

public class Main {
	public static void main(String[] args) {
		Integer[] A = {5, 4, 2, 3, 1};
		Arrays.sort(A, Collections.reverseOrder());
		System.out.println(Arrays.toString(A));
	}
}

import java.util.*;

public class Main {
	public static void main(String[] args) {
		int[] A = {5, 4, 2, 3, 1};
		negate(A);
		Arrays.sort(A);
		negate(A);
		System.out.println(Arrays.toString(A));
	}
	
	static void negate(int[] temp) {
		for(int i = 0; i < temp.length; i++) {
			temp[i] *= -1;
		}
	}
}