Auto-generated commit

Author: stdlib-bot

CHANGELOG.md

@@ -731,7 +731,6 @@ A total of 95 issues were closed in this release:
 
 <details>
 
--   [`0359230`](https://github.com/stdlib-js/stdlib/commit/0359230c32ad65ec22d76e3c6fb5679c9dd88255) - **bench:** refactor to use dynamic memory allocation in `math/strided/special/dinv` [(#11666)](https://github.com/stdlib-js/stdlib/pull/11666) _(by Uday Kakade)_
 -   [`4948ecc`](https://github.com/stdlib-js/stdlib/commit/4948ecca63ca031e99f94d72def40f445852e4db) - **bench:** refactor to use dynamic memory allocation in `math/strided/special/dsqrt` [(#11668)](https://github.com/stdlib-js/stdlib/pull/11668) _(by Uday Kakade)_
 -   [`2cd5062`](https://github.com/stdlib-js/stdlib/commit/2cd5062361403748ac15fd295708f925d4c3c92f) - **bench:** refactor to use dynamic memory allocation in `math/strided/special/dtrunc` [(#11669)](https://github.com/stdlib-js/stdlib/pull/11669) _(by Uday Kakade)_
 -   [`0f96d30`](https://github.com/stdlib-js/stdlib/commit/0f96d3092e11bed46e6cd83efd770c2d6fa77af1) - **docs:** update namespace table of contents [(#11637)](https://github.com/stdlib-js/stdlib/pull/11637) _(by stdlib-bot, Philipp Burckhardt)_

README.md

@@ -139,11 +139,6 @@ For more information on the project, filing bug reports and feature requests, an
 
 ---
 
-## License
-
-See [LICENSE][stdlib-license].
-
-
 ## Copyright
 
 Copyright © 2016-2026. The Stdlib [Authors][stdlib-authors].
@@ -190,8 +185,6 @@ Copyright © 2016-2026. The Stdlib [Authors][stdlib-authors].
 [esm-readme]: https://github.com/stdlib-js/math/blob/esm/README.md
 [branches-url]: https://github.com/stdlib-js/math/blob/main/branches.md
 
-[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/math/main/LICENSE
-
 <!-- <toc-links> -->
 
 [@stdlib/math/array]: https://github.com/stdlib-js/math/tree/main/array

strided/special/dinv/benchmark/c/benchmark.length.c

@@ -114,13 +114,11 @@ float rand_uniformf( float a, float b ) {
 */
 static double benchmark( int iterations, int len ) {
 	double elapsed;
-	double *x;
-	double *y;
+	double x[ len ];
+	double y[ len ];
 	double t;
 	int i;
 
-	x = (double *) malloc( len * sizeof( double ) );
-	y = (double *) malloc( len * sizeof( double ) );
 	for ( i = 0; i < len; i++ ) {
 		x[ i ] = rand_uniform( -50.0, 50.0 );
 		y[ i ] = 0.0;
@@ -138,8 +136,6 @@ static double benchmark( int iterations, int len ) {
 	if ( y[ 0 ] != y[ 0 ] ) {
 		printf( "should not return NaN\n" );
 	}
-	free( x );
-	free( y );
 	return elapsed;
 }