| grouping | page | description |
| M_sort::INTRO | M_sort | Fortran module containing sorting algorithms for arrays of standard scalar types (LICENSE:PD) |
| M_sort:sort:heapsort | sort_heap | indexed sort of an array (LICENSE:PD) |
| M_sort:sort:quicksort | sort_quick_compact | recursive quicksort of an array (LICENSE: CC BY 3.0) |
| M_sort:sort:quicksort | sort_quick_rx | indexed hybrid quicksort of an array (LICENSE:PD) |
| M_sort:sort:shellsort | sort_shell | Generic subroutine sorts the array X using Shell's Method (LICENSE:PD) |
| M_sort:sort:treesort | tree_insert | sort a number of integers by building a tree, sorted in infix order (LICENSE:MIT) |
| M_sort | swap | elemental subroutine swaps two standard type variables of like type (LICENSE:PD) |
| M_sort | swap_any | subroutine swaps two variables of like type (LICENSE:PD) |
| M_sort | tree_print | print a sorted integer tree generated by tree_insert(3f) (LICENSE:MIT) |
| M_sort | unique | return array with adjacent duplicate values removed (LICENSE:PD) |