Fixed quicksort algorithms to properly use pre-sorted index arrays

MintonGroup · Oct 25, 2021 · e6b176d · e6b176d
1 parent 255a4b5
commit e6b176d
Showing 1 changed file with 6 additions and 3 deletions.
diff --git a/src/util/util_sort.f90 b/src/util/util_sort.f90
@@ -93,7 +93,8 @@ module pure subroutine util_sort_index_dp(arr, ind)
          allocate(ind(n))
          ind = [(i, i=1, n)]
       end if
-      allocate(tmparr, source=arr)
+      allocate(tmparr, mold=arr)
+      tmparr(:) = arr(ind(:))
       call qsort_DP(tmparr, ind)
 
       return
@@ -221,7 +222,8 @@ module pure subroutine util_sort_index_i4b(arr, ind)
          allocate(ind(n))
          ind = [(i, i=1, n)]
       end if
-      allocate(tmparr, source=arr)
+      allocate(tmparr, mold=arr)
+      tmparr(:) = arr(ind(:))
       call qsort_I4B(tmparr, ind)
 
       return
@@ -348,7 +350,8 @@ module pure subroutine util_sort_index_sp(arr, ind)
          allocate(ind(n))
          ind = [(i, i=1, n)]
       end if
-      allocate(tmparr, source=arr)
+      allocate(tmparr, mold=arr)
+      tmparr(:) = arr(ind(:))
       call qsort_SP(tmparr, ind)
 
       return