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/ssorthp/src/main.c

@@ -39,7 +39,7 @@
 * @param X        input array
 * @param strideX  stride length
 */
-void API_SUFFIX(stdlib_strided_ssorthp)( const CBLAS_INT N, const float order, float *X, const CBLAS_INT strideX) {
+void API_SUFFIX(stdlib_strided_ssorthp)( const CBLAS_INT N, const float order, float *X, const CBLAS_INT strideX ) {
 	CBLAS_INT ox = stdlib_strided_stride2offset( N, strideX );
 	API_SUFFIX(stdlib_strided_ssorthp_ndarray)( N, order, X, strideX, ox );
 }
@@ -75,11 +75,11 @@ void API_SUFFIX(stdlib_strided_ssorthp_ndarray)( const CBLAS_INT N, const float
 	float v2;
 	float t;
 
-	if ( N <= 0 || order == 0.0 ) {
+	if ( N <= 0 || order == 0.0f ) {
 		return;
 	}
 	// For a positive stride, sorting in decreasing order is equivalent to providing a negative stride and sorting in increasing order, and, for a negative stride, sorting in decreasing order is equivalent to providing a positive stride and sorting in increasing order...
-	if ( order < 0.0 ) {
+	if ( order < 0.0f ) {
 		sx = -strideX;
 		ox = offsetX - ( (N-1)*sx );
 	} else {