stdlib_sorting_sort Submodule

This submodule implements the overloaded sorting subroutine SORT that can be used to sort four kinds of INTEGER arrays and three kinds of REAL arrays. Sorting is in order of increasing value, with the worst case run time performance of O(N Ln(N)).

SORT uses the INTROSORT sorting algorithm of David Musser, http://www.cs.rpi.edu/~musser/gp/introsort.ps. introsort is a hybrid unstable comparison algorithm combining quicksort, insertion sort, and heap sort. While this algorithm is always O(N Ln(N)) it is relatively fast on randomly ordered data, but inconsistent in performance on partly sorted data, sometimes having merge sort performance, sometimes having better than quicksort performance.


Uses

  • module~~stdlib_sorting_sort~~UsesGraph module~stdlib_sorting_sort stdlib_sorting_sort module~stdlib_sorting stdlib_sorting module~stdlib_sorting_sort->module~stdlib_sorting module~stdlib_string_type stdlib_string_type module~stdlib_sorting->module~stdlib_string_type module~stdlib_optval stdlib_optval module~stdlib_sorting->module~stdlib_optval module~stdlib_kinds stdlib_kinds module~stdlib_sorting->module~stdlib_kinds module~stdlib_string_type->module~stdlib_optval module~stdlib_string_type->module~stdlib_kinds module~stdlib_ascii stdlib_ascii module~stdlib_string_type->module~stdlib_ascii module~stdlib_optval->module~stdlib_kinds iso_fortran_env iso_fortran_env module~stdlib_kinds->iso_fortran_env iso_c_binding iso_c_binding module~stdlib_kinds->iso_c_binding module~stdlib_ascii->module~stdlib_kinds

Contents

None