Update ndarray.js

Signed-off-by: Kaushikgtm <162317291+Kaushikgtm@users.noreply.github.com>

Author: Kaushikgtm

lib/node_modules/@stdlib/stats/base/nanmskmin/lib/ndarray.js

@@ -33,10 +33,10 @@ var accessors = require( './accessors.js' );
 *
 * @param {PositiveInteger} N - number of indexed elements
 * @param {NumericArray} x - input array
-* @param {integer} StrideX - `x` stride length
+* @param {integer} strideX - `x` stride length
 * @param {NonNegativeInteger} offsetX - `x` starting index
 * @param {NumericArray} mask - mask array
-* @param {integer} StrideMask - `mask` stride length
+* @param {integer} strideMask - `mask` stride length
 * @param {NonNegativeInteger} offsetMask - `mask` starting index
 * @returns {number} minimum value
 *
@@ -69,28 +69,43 @@ function nanmskmin( N, x, strideX, offsetX, mask, strideMask, offsetMask ) {
 	}
 	ix = offsetX;
 	im = offsetMask;
+
+	// Check for NaN in unmasked elements
 	for ( i = 0; i < N; i++ ) {
-		if( mask[im] === 0 ){
+		if ( mask[im] === 0 && isnan( x[ix] ) ) {
+			return NaN;
+		}
+		ix += strideX;
+		im += strideMask;
+	}
+
+	// Reset indices
+	ix = offsetX;
+	im = offsetMask;
+
+	// Find the first unmasked element
+	for ( i = 0; i < N; i++ ) {
+		if ( mask[im] === 0 ) {
 			break;
 		}
 		ix += strideX;
 		im += strideMask;
 	}
+
 	if ( i === N ) {
 		return NaN;
 	}
+
 	min = x[ ix ];
 	i += 1;
+
 	for ( i; i < N; i++ ) {
 		ix += strideX;
 		im += strideMask;
 		if ( mask[ im ] ) {
 			continue;
 		}
 		v = x[ ix ];
-		if ( isnan( v ) ) {
-			continue;
-		}
 		if ( v < min || ( v === min && isNegativeZero( v ) ) ) {
 			min = v;
 		}