๋ฌธ์
ํ์ด
package com.quiz.insersion;
import java.util.Arrays;
interface InsersionSort {
int[] solution(int[] arr);
}
class InsersionImpl implements InsersionSort {
@Override
public int[] solution(int[] arr) {
for (int i = 1; i <= arr.length -1; i++) {
int target = arr[i];
for (int j = (i - 1); j >= 0; j--) {
if (target < arr[j]) {
arr[j + 1] = arr[j];
arr[j] = target;
}
}
System.out.println(Arrays.toString(arr));
}
return arr;
}
}
public class InsersionMain {
public static void main(String[] args) {
int[] arr = {7, 3, 2, 8, 9, 4, 6, 1, 5};
int[] solution = new InsersionImpl().solution(arr);
}
}
Java
๋ณต์ฌ
