-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathExam1_quicksort_11650.java
More file actions
163 lines (147 loc) · 4.17 KB
/
Exam1_quicksort_11650.java
File metadata and controls
163 lines (147 loc) · 4.17 KB
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
package algoritmExam;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Main e = new Main();
List<int[]> list = new ArrayList<int[]>();
Scanner sc = new Scanner(System.in);
int cnt;
//정렬할 갯수
cnt = sc.nextInt();
// cnt = 5;
// System.out.println(cnt);
//입력받는부분
Random ran = new Random();
for(int i=0;i<cnt;i++) {
int []arr = new int[3];
// arr[0] = sc.nextInt();
// arr[1] = sc.nextInt();
//-100000 ~ 100000
arr[0] = ran.nextInt(100000)-100000;
arr[1] = ran.nextInt(1000000)-100000;
// System.out.println(arr[0]+" "+arr[1]);
list.add(arr);
}
//임시데이터 입력
// int []arr1 = new int[3];
// arr1[0]=1;
// arr1[1]=2;
// int []arr2 = new int[3];
// arr2[0]=-11;
// arr2[1]=-100;
// int []arr3 = new int[3];
// arr3[0]=1;
// arr3[1]=200;
// int []arr4 = new int[3];
// arr4[0]=100;
// arr4[1]=-2;
//
// list.add(arr1);
// list.add(arr2);
// list.add(arr3);
// list.add(arr4);
long start = System.currentTimeMillis();
//X정렬(list,몇번째배열 정렬할지,리스트의시작,리스트의끝)
e.quickSort(list,0,0,list.size()-1);
//X가 정렬된 기준으로 그룹핑
e.makeGroup(list, 0);
int groupCnt=0;
int startIdx=0;
int endIdx=0;
//Y좌표(배열의 두번째인자)정렬
//그룹핑된 애들의 start와 end를 구해 그 값으로 LIST정렬
for(int i=1;i<list.size();i++){
int groupNum = list.get(i)[2];
if(groupNum==groupCnt) {
endIdx++;
if(i==list.size()-1) {
e.quickSort(list, 1, startIdx,endIdx);
}else {
continue;
}
}else {
e.quickSort(list, 1, startIdx,endIdx);
startIdx=i;
endIdx=i;
groupCnt++;
}
}
long end = System.currentTimeMillis();
System.out.println( "실행 시간 : " + ( end - start )/1000.0 );
// e.showList(list);
}
/*
* 그룹핑할 리스트,몇번째인자 그룹핑할지
* result: seq번째있는 배열중 같은값은 0부터 같은값으로 그룹핑됨
*/
public void makeGroup(List<int[]> list,int seq){
int groupIdx=0;
int isSame=0;
for(int i=0;i<list.size();i++){
if(i==0){
isSame = list.get(i)[seq];
list.get(i)[2]=groupIdx;
continue;
}
if(isSame==list.get(i)[seq]){
list.get(i)[2]=groupIdx;
}else{
isSame=list.get(i)[seq];
list.get(i)[2]=++groupIdx;
}
}
}
/*
* 선택정렬
* 그룹핑할 리스트,몇번째인자 솔팅할지,LIST의 시작,LIST의 끝
* result: seq번째있는 배열기준으로 LIST를 soring
*/
public void selectSort(List<int[]> list,int seq,int startIdx,int endIdx){
//seq번째의 배열로 내림차순비교 -> list를 정렬함
int min;
int[] tmp;
for(int i=startIdx;i<endIdx;i++){
min = i;
for (int j = i + 1; j < endIdx+1; j++) {
if (list.get(j)[seq] < list.get(min)[seq])
min = j;
}
tmp = list.get(i);
list.set(i, list.get(min));
list.set(min,tmp);
}
}
/*
* 퀵정렬
* 그룹핑할 리스트,몇번째인자 솔팅할지,LIST의 시작,LIST의 끝
* result: seq번째있는 배열기준으로 LIST를 soring
*/
public void quickSort(List<int[]> data,int seq, int l, int r){
int left = l;
int right = r;
// int pivot = data[(l+r)/2];
int pivot = data.get((l+r)/2)[seq];
do{
while(data.get(left)[seq] < pivot) left++;
while(data.get(right)[seq] > pivot) right--;
if(left <= right){
int[] temp = data.get(left);
// data[left] = data[right];
data.set(left,data.get(right));
data.set(right,temp);
left++;
right--;
}
}while (left <= right);
if(l < right) quickSort(data,seq, l, right);
if(r > left) quickSort(data,seq, left, r);
}
public void showList(List<int[]> list){
for(int i=0;i<list.size();i++){
System.out.println(list.get(i)[0]+" "+list.get(i)[1]);
}
}
}