sort_ps Interface Reference

Sorting routine for integer arrays (partially sorted) More...

Collaboration diagram for sort_ps:

Private Member Functions
pure subroutine	sort_ps_is_ (n, array, sarray)
pure subroutine	sort_ps_ii_ (n, array, sarray)
pure subroutine	sort_ps_il_ (n, array, sarray)

Detailed Description

Sorting routine for integer arrays (partially sorted)

Re-arranges the values in an integer array and returns the resulting sorted array in another array.

This routine is fastest for partially sorted arrays such as:

array = (/1,2,3,4,25,26,27,28,15,16,17/)

To sort generic arrays using the quick-sort algorithm may be faster.

---

The documentation for this interface was generated from the following file:

• src/bud_utils.f90