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
|
subroutine MergeSort(List)
type (TSortData), intent(inout) :: List(:)
type (TSortData) :: Temp(size(List))
call MergeSortSub(1,size(List))
contains
recursive subroutine MergeSortSub(First,Last)
integer, intent(in) :: First,Last
integer Middle
if (First < Last) then
Middle = (First + Last) / 2
call MergeSortSub(First, Middle)
call MergeSortSub(Middle+1, Last)
call MergeSub(First, Middle, Last)
endif
end subroutine MergeSortSub
subroutine MergeSub(First, Middle, Last)
integer, intent(in) :: First,Last, Middle
integer k1, k2, k
k1 = First
k2 = Middle + 1
k = First
! write(0,*) 'MergeSub:',First,Middle,Last
do while(k1 <= Middle .and. k2 <= Last)
if (List(k1) < List(k2)) then
Temp(k) = List(k1)
k1 = k1 + 1
else
Temp(k) = List(k2)
k2 = k2 + 1
endif
k = k + 1
enddo
do while(k1 <= Middle)
Temp(k) = List(k1)
k1 = k1 + 1
k = k + 1
enddo
do while(k2 <= Last)
Temp(k) = List(k2)
k2 = k2 + 1
k = k + 1
enddo
do k = First, Last
List(k) = Temp(k)
enddo
end subroutine MergeSub
end subroutine MergeSort |
Partager