fixed typo

Author: jvdp1

src/stdlib_sorting_sort.fypp

@@ -87,9 +87,9 @@ contains
 #:for k1, t1 in IRS_KINDS_TYPES
 
     pure subroutine ${k1}$_${sname}$_sort( array )
-! `${k1}$_${name}$_sort( array )` sorts the input `ARRAY` of type `${t1}$`
+! `${k1}$_${sname}$_sort( array )` sorts the input `ARRAY` of type `${t1}$`
 ! using a hybrid sort based on the `introsort` of David Musser. As with
-! `introsort`, `${k1}$_${name}$_sort( array )` is an unstable hybrid comparison
+! `introsort`, `${k1}$_${sname}$_sort( array )` is an unstable hybrid comparison
 ! algorithm using `quicksort` for the main body of the sort tree,
 ! supplemented by `insertion sort` for the outer branches, but if
 ! `quicksort` is converging too slowly the algorithm resorts
@@ -275,9 +275,9 @@ contains
 
 #:for sname, signt, signoppt in SIGN_NAME_TYPE
     pure subroutine char_${sname}$_sort( array )
-! `char_${name}$_sort( array )` sorts the input `ARRAY` of type `CHARACTER(*)`
+! `char_${sname}$_sort( array )` sorts the input `ARRAY` of type `CHARACTER(*)`
 ! using a hybrid sort based on the `introsort` of David Musser. As with
-! `introsort`, `char_${name}$_sort( array )` is an unstable hybrid comparison
+! `introsort`, `char_${sname}$_sort( array )` is an unstable hybrid comparison
 ! algorithm using `quicksort` for the main body of the sort tree,
 ! supplemented by `insertion sort` for the outer branches, but if
 ! `quicksort` is converging too slowly the algorithm resorts