Apply suggestions from code review

Co-authored-by: Athan <kgryte@gmail.com>
Signed-off-by: Athan <kgryte@gmail.com>

Author: kgryte

lib/node_modules/@stdlib/blas/ext/base/ssort/benchmark/c/unsorted-random/benchmark.length.c

@@ -23,7 +23,7 @@
 #include <time.h>
 #include <sys/time.h>
 
-#define NAME "dsort"
+#define NAME "ssort"
 #define ITERATIONS 10000000
 #define REPEATS 3
 #define MIN 1
@@ -185,7 +185,7 @@ int main( void ) {
 		iter = ITERATIONS / pow( 10, i-1 );
 		for ( j = 0; j < REPEATS; j++ ) {
 			count += 1;
-			printf( "# c::%s:ndarray:unsorted,random:len=%d\n", NAME, len );
+			printf( "# c::%s::unsorted,random:ndarray:len=%d\n", NAME, len );
 			elapsed = benchmark2( iter, len );
 			print_results( iter, elapsed );
 			printf( "ok %d benchmark finished\n", count );

lib/node_modules/@stdlib/blas/ext/base/ssort/examples/c/example.c

@@ -30,7 +30,7 @@ int main( void ) {
 	int strideX = 1;
 
 	// Sort the array:
-	stdlib_strided_dsort( N, 1.0f, x, strideX );
+	stdlib_strided_ssort( N, 1.0f, x, strideX );
 
 	// Print the result:
 	for ( int i = 0; i < 8; i++ ) {