05/01/25 21:56:55
def qsort(s, first, last)
if first < last then
pivot = s[last]
i = first
j = last - 1
while true do
while i < last && s[i] < pivot do
i += 1
end
while j >= first && s[i] >pivot do
j -= 1
end
if i >= j then
break
end
つづきます。
05/01/25 21:56:55
def qsort(s, first, last)
if first < last then
pivot = s[last]
i = first
j = last - 1
while true do
while i < last && s[i] < pivot do
i += 1
end
while j >= first && s[i] >pivot do
j -= 1
end
if i >= j then
break
end
つづきます。