bench: use dynamic memory reallocation

---
type: pre_commit_static_analysis_report
description: Results of running static analysis checks when committing changes.
report:
  - task: lint_filenames
    status: passed
  - task: lint_editorconfig
    status: passed
  - task: lint_markdown
    status: na
  - task: lint_package_json
    status: na
  - task: lint_repl_help
    status: na
  - task: lint_javascript_src
    status: na
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: na
  - task: lint_javascript_tests
    status: na
  - task: lint_javascript_benchmarks
    status: na
  - task: lint_python
    status: na
  - task: lint_r
    status: na
  - task: lint_c_src
    status: na
  - task: lint_c_examples
    status: na
  - task: lint_c_benchmarks
    status: missing_dependencies
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: passed
  - task: lint_typescript_tests
    status: na
  - task: lint_license_headers
    status: passed
---

Author: DivitJain26

lib/node_modules/@stdlib/blas/base/cgemv/benchmark/c/benchmark.length.c

@@ -100,13 +100,16 @@ static double benchmark1( int iterations, int N ) {
 	stdlib_complex64_t alpha;
 	stdlib_complex64_t beta;
 	double elapsed;
-	float A[ N*N*2 ];
-	float x[ N*2 ];
-	float y[ N*2 ];
+	float *A;
+	float *x;
+	float *y;
 	double t;
 	int i;
 	int j;
 
+	A = (float *)malloc( N * N * 2 * sizeof( float ) );
+	x = (float *)malloc( N * 2 * sizeof( float ) );
+	y = (float *)malloc( N * 2 * sizeof( float ) );
 	alpha = stdlib_complex64( 0.5f, 0.5f );
 	beta = stdlib_complex64( 0.5f, -0.5f );
 
@@ -131,6 +134,9 @@ static double benchmark1( int iterations, int N ) {
 	if ( y[ i%N ] != y[ i%N ] ) {
 		printf( "should not return NaN\n" );
 	}
+	free( A );
+	free( x );
+	free( y );
 	return elapsed;
 }
 
@@ -145,13 +151,16 @@ static double benchmark2( int iterations, int N ) {
 	stdlib_complex64_t alpha;
 	stdlib_complex64_t beta;
 	double elapsed;
-	float A[ N*N*2 ];
-	float x[ N*2 ];
-	float y[ N*2 ];
+	float *A;
+	float *x;
+	float *y;
 	double t;
 	int i;
 	int j;
 
+	A = (float *)malloc( N * N * 2 * sizeof( float ) );
+	x = (float *)malloc( N * 2 * sizeof( float ) );
+	y = (float *)malloc( N * 2 * sizeof( float ) );
 	alpha = stdlib_complex64( 0.5f, 0.5f );
 	beta = stdlib_complex64( 0.5f, -0.5f );
 
@@ -176,6 +185,9 @@ static double benchmark2( int iterations, int N ) {
 	if ( y[ i%N ] != y[ i%N ] ){
 		printf( "should not return NaN\n" );
 	}
+	free( A );
+	free( x );
+	free( y );
 	return elapsed;
 }