| grouping | page | description |
| M_orderpack::INTRO | M_orderpack | General and Specialized Ranking and Sorting Routines |
| M_orderpack:FRACTILE | orderloc | Return INDEX of Nth ordered value of array (Quick-Sort-like) |
| M_orderpack:FRACTILE | orderval | Return VALUE of Nth ordered element of array (Quick-Sort-like) |
| M_orderpack:FRACTILE | orderval_special | Return VALUE of Nth ordered element of array (InsertSort-like) |
| M_orderpack:MEDIAN | median | Calculates median VALUE. If number of elements is even, returns average of the two "medians". |
| M_orderpack:MEDIAN | medianloc | Returns median value's INDEX. |
| M_orderpack:MEDIAN | medianval | Returns median VALUE. |
| M_orderpack:MULTIPLICITY | occurrences | Give the multiplicity for each array value (number of times that it appears in the array) |
| M_orderpack:PERMUTATION | perturb | generate a random permutation of an array leaving elements close to initial locations |
| M_orderpack:RANK:PARTIAL:UNIQUE | prank_unique | partially ranks an array removing duplicates |
| M_orderpack:RANK:PARTIAL | prank | partially ranks an array (Quick-Sort-like) |
| M_orderpack:RANK:PARTIAL | prank_basic | partially ranks an array (Quick-Sort) |
| M_orderpack:RANK:PARTIAL | prank_decreasing | partially ranks an array in DECREASING order. |
| M_orderpack:RANK:PARTIAL | prank_special | partially ranks an array in ASCENDING order (Insertion Sort) |
| M_orderpack:RANK:UNIQUE | rank_decreasing | ranks an array in decreasing order, with duplicate entries assigned the same rank(Merge-Sort) |
| M_orderpack:RANK:UNIQUE | rank_unique | ranks an array, with removal of duplicate entries (Merge-Sort) |
| M_orderpack:RANK | rank | produces an INDEX that sorts an input array (optimized merge-sort) |
| M_orderpack:RANK | rank_basic | create an INDEX that defines the order of array sorted in ascending order (basic merge-sort) |
| M_orderpack:SORT:PARTIAL | psort | partially sorts an array (Insertion Sort, generally for small or nearly sorted arrays) |
| M_orderpack:SORT | sort | Sorts array into ascending order (Quick-sort) |
| M_orderpack:SORT | sort_special | Sorts array into ascending order (Insertion sort, generally for small or nearly sorted arrays) |
| M_orderpack:UNIQUE | unique | removes duplicates from an array otherwise retaining original order (i.e. it is "stable") |