find_binheur Interface Reference

Searches for a specific integer value in a sorted array (heuristic search) More...

Collaboration diagram for find_binheur:

Private Member Functions
pure subroutine	find_binheur_is_ (n, array, val, idx)
pure subroutine	find_binheur_ii_ (n, array, val, idx)
pure subroutine	find_binheur_il_ (n, array, val, idx)

Detailed Description

Searches for a specific integer value in a sorted array (heuristic search)

Efficient binary-like search algorithm for searching for specific elements in an integer array.

---

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

• src/bud_utils.f90