質問編集履歴
1
コードの追加
test
CHANGED
|
File without changes
|
test
CHANGED
|
@@ -491,3 +491,73 @@
|
|
|
491
491
|
|
|
492
492
|
|
|
493
493
|
```
|
|
494
|
+
|
|
495
|
+
quicksortは以下の通りです
|
|
496
|
+
|
|
497
|
+
```c
|
|
498
|
+
|
|
499
|
+
void quicksort(int list1[],double list2[], int left, int right)
|
|
500
|
+
|
|
501
|
+
{
|
|
502
|
+
|
|
503
|
+
int i, last;
|
|
504
|
+
|
|
505
|
+
double temp;
|
|
506
|
+
|
|
507
|
+
|
|
508
|
+
|
|
509
|
+
if (left >= right)
|
|
510
|
+
|
|
511
|
+
return;
|
|
512
|
+
|
|
513
|
+
|
|
514
|
+
|
|
515
|
+
last = left;
|
|
516
|
+
|
|
517
|
+
for (i=left+1; i <= right; i++){
|
|
518
|
+
|
|
519
|
+
if (list2[i] < list2[left] ){
|
|
520
|
+
|
|
521
|
+
last++;
|
|
522
|
+
|
|
523
|
+
temp=list2[last];
|
|
524
|
+
|
|
525
|
+
list2[last]=list2[i];
|
|
526
|
+
|
|
527
|
+
list2[i]=temp;
|
|
528
|
+
|
|
529
|
+
temp=list1[last];
|
|
530
|
+
|
|
531
|
+
list1[last]=list1[i];
|
|
532
|
+
|
|
533
|
+
list1[i]=temp;
|
|
534
|
+
|
|
535
|
+
}
|
|
536
|
+
|
|
537
|
+
}
|
|
538
|
+
|
|
539
|
+
|
|
540
|
+
|
|
541
|
+
temp=list2[left];
|
|
542
|
+
|
|
543
|
+
list2[left]=list2[last];
|
|
544
|
+
|
|
545
|
+
list2[last]=temp;
|
|
546
|
+
|
|
547
|
+
temp=list1[left];
|
|
548
|
+
|
|
549
|
+
list1[left]=list1[last];
|
|
550
|
+
|
|
551
|
+
list1[last]=temp;
|
|
552
|
+
|
|
553
|
+
|
|
554
|
+
|
|
555
|
+
quicksort(list1,list2,left, last-1);
|
|
556
|
+
|
|
557
|
+
quicksort(list1,list2,last+1, right);
|
|
558
|
+
|
|
559
|
+
}
|
|
560
|
+
|
|
561
|
+
|
|
562
|
+
|
|
563
|
+
```
|