forgex_sort_m Module

The forgex_sort_m module provides an implementation of sorting algorithms for integer arrays.

Currently, complex sorting algorithms are not required, only simple algorithms are used, but this does not constrain future implementations.


Uses


Subroutines

public pure subroutine bubble_sort(list)

Implementing insertion sort instead of this algorithm is considered.

Arguments

Type IntentOptional Attributes Name
integer(kind=int32), intent(inout) :: list(:)

public pure subroutine insertion_sort(list)

Arguments

Type IntentOptional Attributes Name
integer, intent(inout) :: list(:)