-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathqsort_c_module.f90
256 lines (210 loc) · 5.29 KB
/
qsort_c_module.f90
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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
! Recursive Fortran 95 quicksort routine
! sorts real numbers into ascending numerical order
! Author: Juli Rew, SCD Consulting ([email protected]), 9/03
! Based on algorithm from Cormen et al., Introduction to Algorithms,
! 1997 printing
!
! Made F conformant by Walt Brainerd
! Modified for use in Cappuccino code by Nikola Mirkov ([email protected])
!
module qsort_c_module
implicit none
public :: QsortC
private :: Partition
contains
recursive subroutine QsortC(A, A1,A2,A3,A4, B1,B2,B3,B4)
integer, intent(in out), dimension(:) :: A
integer, intent(in out), dimension(:) :: A1,A2,A3,A4
integer, intent(in out), dimension(:) :: B1,B2,B3,B4
integer :: iq
if(size(A) > 1) then
call Partition(A, iq, A1,A2,A3,A4, B1,B2,B3,B4)
call QsortC( A(:iq-1), A1(:iq-1),A2(:iq-1),A3(:iq-1),A4(:iq-1), B1(:iq-1),B2(:iq-1),B3(:iq-1),B4(:iq-1) )
call QsortC( A(iq:), A1(iq:),A2(iq:),A3(iq:),A4(iq:), B1(iq:),B2(iq:),B3(iq:),B4(iq:) )
endif
end subroutine QsortC
subroutine Partition(A, marker, A1,A2,A3,A4, B1,B2,B3,B4)
integer, intent(in out), dimension(:) :: A
integer, intent(in out), dimension(:) :: A1,A2,A3,A4
integer, intent(in out), dimension(:) :: B1,B2,B3,B4
integer, intent(out) :: marker
integer :: i, j
integer :: temp
integer :: x ! pivot point
x = A(1)
i= 0
j= size(A) + 1
do
j = j-1
do
if (A(j) <= x) exit
j = j-1
end do
i = i+1
do
if (A(i) >= x) exit
i = i+1
end do
if (i < j) then
! exchange A(i) and A(j)
temp = A(i)
A(i) = A(j)
A(j) = temp
! do the companion matrix:
temp = A1(i)
A1(i) = A1(j)
A1(j) = temp
temp = A2(i)
A2(i) = A2(j)
A2(j) = temp
temp = A3(i)
A3(i) = A3(j)
A3(j) = temp
temp = A4(i)
A4(i) = A4(j)
A4(j) = temp
! do the other companion matrix:
temp = B1(i)
B1(i) = B1(j)
B1(j) = temp
temp = B2(i)
B2(i) = B2(j)
B2(j) = temp
temp = B3(i)
B3(i) = B3(j)
B3(j) = temp
temp = B4(i)
B4(i) = B4(j)
B4(j) = temp
elseif (i == j) then
marker = i+1
return
else
marker = i
return
endif
end do
end subroutine Partition
recursive subroutine QsortC2(A, A1, B1,B2,B3,B4)
integer, intent(in out), dimension(:) :: A
integer, intent(in out), dimension(:) :: A1
integer, intent(in out), dimension(:) :: B1,B2,B3,B4
integer :: iq
if(size(A) > 1) then
call Partition2(A, iq, A1, B1,B2,B3,B4)
call QsortC2( A(:iq-1), A1(:iq-1), B1(:iq-1),B2(:iq-1),B3(:iq-1),B4(:iq-1) )
call QsortC2( A(iq:), A1(iq:), B1(iq:),B2(iq:),B3(iq:),B4(iq:) )
endif
end subroutine QsortC2
subroutine Partition2(A, marker, A1, B1,B2,B3,B4)
integer, intent(in out), dimension(:) :: A
integer, intent(in out), dimension(:) :: A1
integer, intent(in out), dimension(:) :: B1,B2,B3,B4
integer, intent(out) :: marker
integer :: i, j
integer :: temp
integer :: x ! pivot point
x = A(1)
i= 0
j= size(A) + 1
do
j = j-1
do
if (A(j) <= x) exit
j = j-1
end do
i = i+1
do
if (A(i) >= x) exit
i = i+1
end do
if (i < j) then
! exchange A(i) and A(j)
temp = A(i)
A(i) = A(j)
A(j) = temp
! do the companion matrix:
temp = A1(i)
A1(i) = A1(j)
A1(j) = temp
! do the other companion matrix:
temp = B1(i)
B1(i) = B1(j)
B1(j) = temp
temp = B2(i)
B2(i) = B2(j)
B2(j) = temp
temp = B3(i)
B3(i) = B3(j)
B3(j) = temp
temp = B4(i)
B4(i) = B4(j)
B4(j) = temp
elseif (i == j) then
marker = i+1
return
else
marker = i
return
endif
end do
end subroutine Partition2
recursive subroutine QsortC3(A, B1,B2,B3,B4)
integer, intent(in out), dimension(:) :: A
integer, intent(in out), dimension(:) :: B1,B2,B3,B4
integer :: iq
if(size(A) > 1) then
call Partition3(A, iq, B1,B2,B3,B4)
call QsortC3( A(:iq-1), B1(:iq-1),B2(:iq-1),B3(:iq-1),B4(:iq-1) )
call QsortC3( A(iq:), B1(iq:),B2(iq:),B3(iq:),B4(iq:) )
endif
end subroutine QsortC3
subroutine Partition3(A, marker, B1,B2,B3,B4)
integer, intent(in out), dimension(:) :: A
integer, intent(in out), dimension(:) :: B1,B2,B3,B4
integer, intent(out) :: marker
integer :: i, j
integer :: temp
integer :: x ! pivot point
x = A(1)
i= 0
j= size(A) + 1
do
j = j-1
do
if (A(j) <= x) exit
j = j-1
end do
i = i+1
do
if (A(i) >= x) exit
i = i+1
end do
if (i < j) then
! exchange A(i) and A(j)
temp = A(i)
A(i) = A(j)
A(j) = temp
! do the companion matrix:
temp = B1(i)
B1(i) = B1(j)
B1(j) = temp
temp = B2(i)
B2(i) = B2(j)
B2(j) = temp
temp = B3(i)
B3(i) = B3(j)
B3(j) = temp
temp = B4(i)
B4(i) = B4(j)
B4(j) = temp
elseif (i == j) then
marker = i+1
return
else
marker = i
return
endif
end do
end subroutine Partition3
end module qsort_c_module