gn="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacemath_1_1math__sort.html#a474c4cc3d05d09a04a1adfde7047062c">math_isort</a> (array, indexes)</td></tr>
<tr class="memdesc:a474c4cc3d05d09a04a1adfde7047062c"><td class="mdescLeft">&#160;</td><td class="mdescRight">indexing array so that array(indexes(j)), j=1..n is in ascending numerical order. method is heapsort, see also subroutine hpsort. taken from numerical recipies, p 233.  <a href="#a474c4c