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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
| // 42jerrykim.github.io에서 더 많은 정보를 확인 할 수 있다
import java.util.*;
// Strategy 인터페이스
interface SortStrategy<T extends Comparable<T>> {
void sort(List<T> list);
String getName();
}
// ConcreteStrategy - 버블 정렬
class BubbleSort<T extends Comparable<T>> implements SortStrategy<T> {
@Override
public void sort(List<T> list) {
int n = list.size();
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (list.get(j).compareTo(list.get(j + 1)) > 0) {
T temp = list.get(j);
list.set(j, list.get(j + 1));
list.set(j + 1, temp);
}
}
}
}
@Override
public String getName() {
return "버블 정렬 O(n²)";
}
}
// ConcreteStrategy - 퀵 정렬
class QuickSort<T extends Comparable<T>> implements SortStrategy<T> {
@Override
public void sort(List<T> list) {
quickSort(list, 0, list.size() - 1);
}
private void quickSort(List<T> list, int low, int high) {
if (low < high) {
int pi = partition(list, low, high);
quickSort(list, low, pi - 1);
quickSort(list, pi + 1, high);
}
}
private int partition(List<T> list, int low, int high) {
T pivot = list.get(high);
int i = low - 1;
for (int j = low; j < high; j++) {
if (list.get(j).compareTo(pivot) < 0) {
i++;
T temp = list.get(i);
list.set(i, list.get(j));
list.set(j, temp);
}
}
T temp = list.get(i + 1);
list.set(i + 1, list.get(high));
list.set(high, temp);
return i + 1;
}
@Override
public String getName() {
return "퀵 정렬 O(n log n)";
}
}
// ConcreteStrategy - 병합 정렬
class MergeSort<T extends Comparable<T>> implements SortStrategy<T> {
@Override
public void sort(List<T> list) {
if (list.size() > 1) {
List<T> sorted = mergeSort(list);
for (int i = 0; i < sorted.size(); i++) {
list.set(i, sorted.get(i));
}
}
}
private List<T> mergeSort(List<T> list) {
if (list.size() <= 1) return list;
int mid = list.size() / 2;
List<T> left = mergeSort(new ArrayList<>(list.subList(0, mid)));
List<T> right = mergeSort(new ArrayList<>(list.subList(mid, list.size())));
return merge(left, right);
}
private List<T> merge(List<T> left, List<T> right) {
List<T> result = new ArrayList<>();
int i = 0, j = 0;
while (i < left.size() && j < right.size()) {
if (left.get(i).compareTo(right.get(j)) <= 0) {
result.add(left.get(i++));
} else {
result.add(right.get(j++));
}
}
while (i < left.size()) result.add(left.get(i++));
while (j < right.size()) result.add(right.get(j++));
return result;
}
@Override
public String getName() {
return "병합 정렬 O(n log n)";
}
}
// Context - 정렬기
class Sorter<T extends Comparable<T>> {
private SortStrategy<T> strategy;
public void setStrategy(SortStrategy<T> strategy) {
this.strategy = strategy;
}
public void sort(List<T> list) {
if (strategy == null) {
System.out.println("정렬 전략을 선택해주세요!");
return;
}
System.out.println("\n" + strategy.getName() + " 실행");
System.out.println("정렬 전: " + list);
long startTime = System.nanoTime();
strategy.sort(list);
long endTime = System.nanoTime();
System.out.println("정렬 후: " + list);
System.out.printf("소요 시간: %.3f ms%n", (endTime - startTime) / 1_000_000.0);
}
}
// 사용 예제
public class StrategyDemo {
public static void main(String[] args) {
Sorter<Integer> sorter = new Sorter<>();
// 데이터 준비
List<Integer> data1 = new ArrayList<>(Arrays.asList(64, 34, 25, 12, 22, 11, 90));
List<Integer> data2 = new ArrayList<>(Arrays.asList(64, 34, 25, 12, 22, 11, 90));
List<Integer> data3 = new ArrayList<>(Arrays.asList(64, 34, 25, 12, 22, 11, 90));
// 버블 정렬
sorter.setStrategy(new BubbleSort<>());
sorter.sort(data1);
// 퀵 정렬
sorter.setStrategy(new QuickSort<>());
sorter.sort(data2);
// 병합 정렬
sorter.setStrategy(new MergeSort<>());
sorter.sort(data3);
}
}
|