bench: refactor to use dynamic memory allocation in stats/strided/dmaxabssorted

PR-URL: #11676
Ref: #8643

Reviewed-by: Philipp Burckhardt <pburckhardt@outlook.com>

Author: udaykakade25

lib/node_modules/@stdlib/stats/strided/dmaxabssorted/benchmark/c/benchmark.length.c

@@ -86,11 +86,12 @@ static double tic( void ) {
 */
 static double benchmark1( int iterations, int len ) {
 	double elapsed;
-	double x[ len ];
+	double *x;
 	double v;
 	double t;
 	int i;
 
+	x = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = i - (len/2);
 	}
@@ -108,6 +109,7 @@ static double benchmark1( int iterations, int len ) {
 	if ( v != v ) {
 		printf( "should not return NaN\n" );
 	}
+	free( x );
 	return elapsed;
 }
 
@@ -120,11 +122,12 @@ static double benchmark1( int iterations, int len ) {
 */
 static double benchmark2( int iterations, int len ) {
 	double elapsed;
-	double x[ len ];
+	double *x;
 	double v;
 	double t;
 	int i;
 
+	x = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = i - (len/2);
 	}
@@ -142,6 +145,7 @@ static double benchmark2( int iterations, int len ) {
 	if ( v != v ) {
 		printf( "should not return NaN\n" );
 	}
+	free( x );
 	return elapsed;
 }