Skip to content

Replacing bubblesort in PURR with quicksort #390

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
golasa97 wants to merge 3 commits into
base: develop
Choose a base branch
from
Open

Replacing bubblesort in PURR with quicksort #390

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
c3ca06f
changed fsort from using a bubblesort to mergesort
golasa97 Dec 23, 2025
af93f5f
cleaned up fsort, removed redundant arguments
awgolas Dec 23, 2025
329a8c1
Trigger CI pipeline
awgolas Dec 23, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
55 changes: 40 additions & 15 deletions src/purr.f90
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1910,7 +1910,7 @@ subroutine unrest(bkg,sig0,sigf,tabl,tval,er,gnr,gfr,ggr,gxr,gt,&
els(itemp,ie)=spot
enddo
enddo
call fsort(es,xs,ne,1)
call fsort(es,ne)

!--loop over sequences
do 170 k=1,nseq0
Expand Down Expand Up @@ -2277,7 +2277,7 @@ subroutine unrest(bkg,sig0,sigf,tabl,tval,er,gnr,gfr,ggr,gxr,gt,&
do ie=1,ne
es(ie)=els(itemp,ie)+fis(itemp,ie)+cap(itemp,ie)+bkg(1)
enddo
call fsort(es,xs,ne,1)
call fsort(es,ne)
tmin(itemp)=es(1)
tmax(itemp)=es(ne)
nebin=int(nsamp/(nbin-10+1.76))
Expand Down Expand Up @@ -2780,7 +2780,7 @@ subroutine uw2(rez,aim1,rew,aimw)
return
end subroutine uw2

subroutine fsort(x,y,n,i)
subroutine fsort(x,n)
!-------------------------------------------------------------------
! Floating-point sort routine.
! Sort x and y into increasing x order.
Expand All @@ -2792,21 +2792,46 @@ subroutine fsort(x,y,n,i)
integer::k,j
real(kr)::xt,yt

do k=1,n-1
do j=k+1,n
if (x(k).gt.x(j)) then
xt=x(k)
yt=y(k)
x(k)=x(j)
y(k)=y(j)
x(j)=xt
y(j)=yt
endif
enddo
enddo
if (n <= 1) return
call quicksort(x,1,n)

return
end subroutine fsort

recursive subroutine quicksort(a,l,r)
real(kr), intent(inout) :: a(:)
integer, intent(in) :: l, r
integer :: i, j
real(kr) :: pivot, ta

i = l
j = r
pivot = a((l+r)/2)

do
do while (a(i) < pivot)
i = i + 1
end do
do while (a(j) > pivot)
j = j - 1
end do

if (i <= j) then
ta = a(i)
a(i) = a(j)
a(j) = ta

i = i + 1
j = j - 1
end if

if (i > j) exit
end do

if (l < j) call quicksort(a,l,j)
if (i < r) call quicksort(a,i,r)
end subroutine quicksort

subroutine fsrch(x,xarray,n,i,k)
!-------------------------------------------------------------------
! Floating-point search routine.
Expand Down