質問編集履歴
1
コードの追加
title
CHANGED
|
File without changes
|
body
CHANGED
|
@@ -244,4 +244,39 @@
|
|
|
244
244
|
}
|
|
245
245
|
|
|
246
246
|
|
|
247
|
+
```
|
|
248
|
+
quicksortは以下の通りです
|
|
249
|
+
```c
|
|
250
|
+
void quicksort(int list1[],double list2[], int left, int right)
|
|
251
|
+
{
|
|
252
|
+
int i, last;
|
|
253
|
+
double temp;
|
|
254
|
+
|
|
255
|
+
if (left >= right)
|
|
256
|
+
return;
|
|
257
|
+
|
|
258
|
+
last = left;
|
|
259
|
+
for (i=left+1; i <= right; i++){
|
|
260
|
+
if (list2[i] < list2[left] ){
|
|
261
|
+
last++;
|
|
262
|
+
temp=list2[last];
|
|
263
|
+
list2[last]=list2[i];
|
|
264
|
+
list2[i]=temp;
|
|
265
|
+
temp=list1[last];
|
|
266
|
+
list1[last]=list1[i];
|
|
267
|
+
list1[i]=temp;
|
|
268
|
+
}
|
|
269
|
+
}
|
|
270
|
+
|
|
271
|
+
temp=list2[left];
|
|
272
|
+
list2[left]=list2[last];
|
|
273
|
+
list2[last]=temp;
|
|
274
|
+
temp=list1[left];
|
|
275
|
+
list1[left]=list1[last];
|
|
276
|
+
list1[last]=temp;
|
|
277
|
+
|
|
278
|
+
quicksort(list1,list2,left, last-1);
|
|
279
|
+
quicksort(list1,list2,last+1, right);
|
|
280
|
+
}
|
|
281
|
+
|
|
247
282
|
```
|