Minor formatting changes

Changes two comments so that they are less than 80 columns wide.

[ticket: X]

Author: wclodius2

src/stdlib_sorting.fypp

@@ -369,8 +369,9 @@ module stdlib_sorting
         module subroutine char_ord_sort( array, work, reverse )
 !! Version: experimental
 !!
-!! `char_ord_sort( array[, work, reverse] )` sorts the input `ARRAY` of type `CHARACTER(*)`
-!! using a hybrid sort based on the `'Rust" sort` algorithm found in `slice.rs`
+!! `char_ord_sort( array[, work, reverse] )` sorts the input `ARRAY` of type
+!! `CHARACTER(*)` using a hybrid sort based on the `'Rust" sort` algorithm
+!! found in `slice.rs`
             character(len=*), intent(inout)                  :: array(0:)
             character(len=len(array)), intent(out), optional :: work(0:)
             logical, intent(in), optional                    :: reverse
@@ -403,8 +404,8 @@ module stdlib_sorting
         pure module subroutine char_sort( array, reverse )
 !! Version: experimental
 !!
-!! `char_sort( array[, reverse] )` sorts the input `ARRAY` of type `CHARACTER(*)`
-!! using a hybrid sort based on the `introsort` of David Musser.
+!! `char_sort( array[, reverse] )` sorts the input `ARRAY` of type
+!! `CHARACTER(*)` using a hybrid sort based on the `introsort` of David Musser.
 !! The algorithm is of order O(N Ln(N)) for all inputs.
 !! Because it relies on `quicksort`, the coefficient of the O(N Ln(N))
 !! behavior is small for random data compared to other sorting algorithms.