sort_heap Interface Reference

Heap sort algorithm for integers. More...

Collaboration diagram for sort_heap:

Private Member Functions
pure subroutine	sort_heap_is_ (n, array)
pure subroutine	sort_heap_ii_ (n, array)
pure subroutine	sort_heap_il_ (n, array)
pure subroutine	sort_heap_idx_is_ (n, array, pvt)
pure subroutine	sort_heap_idx_ii_ (n, array, pvt)
pure subroutine	sort_heap_idx_il_ (n, array, pvt)

Detailed Description

Heap sort algorithm for integers.

Heap sort algorithm for sorting integer arrays. Two variants exists where one is in-place, the other returns the pivoting indices to create a sorted array.

---

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

• src/bud_utils.f90