Apply suggestions from code review

Co-authored-by: Gunj Joshi <[email protected]>
Signed-off-by: Harsh Mathur <[email protected]>

Author: Harsh-Mathur-1503

lib/node_modules/@stdlib/math/base/special/lcmf/README.md

@@ -58,7 +58,7 @@ var v = lcmf( 0, 12 );
 // returns 0
 ```
 
-The inputs must be valid floating-point numbers; otherwise, the function returns `NaN`.
+Both `a` and `b` must have integer values; otherwise, the function returns `NaN`.
 
 ```javascript
 var v = lcmf( 3.14, 12 );
@@ -132,22 +132,22 @@ for ( i = 0; i < 100; i++ ) {
 #include "stdlib/math/base/special/lcmf.h"
 ```
 
-### stdlib_base_lcmf( a,b )
+### stdlib_base_lcmf( a, b )
 
 Computes the [least common multiple][lcm] for two single-precision floating-point numbers `a` and `b`.
 
 ```c
 float v = stdlib_base_lcmf( 10.0, 12.0 );
-// returns 60.0
+// returns 60.0f
 ```
 
-The function accepts the following argument:
+The function accepts the following arguments:
 
 -   **a**: `[in] float` input value.
 -   **b**: `[in] float` input value.
 
 ```c
-double stdlib_base_lcmf( const float a, const float b );
+float stdlib_base_lcmf( const float a, const float b );
 ```
 
 </section>
@@ -205,12 +205,6 @@ int main( void ) {
 
 <section class="related">
 
-* * *
-
-## See Also
-
--   <span class="package-name">[`@stdlib/math/base/special/gcd`][@stdlib/math/base/special/gcd]</span><span class="delimiter">: </span><span class="description">compute the greatest common divisor (gcd).</span>
-
 </section>
 
 <!-- /.related -->
@@ -223,8 +217,6 @@ int main( void ) {
 
 <!-- <related-links> -->
 
-[@stdlib/math/base/special/gcd]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/math/base/special/gcd
-
 <!-- </related-links> -->
 
 </section>

lib/node_modules/@stdlib/math/base/special/lcmf/benchmark/benchmark.js

@@ -35,7 +35,10 @@ bench( pkg, function benchmark( b ) {
     var z;
     var i;
 
-    b.tic();
+	x = randu( 100, 0, 50 );
+	y = randu( 100, 0, 50 );
+	
+	b.tic();
     for ( i = 0; i < b.iterations; i++ ) {
 	z = lcmf( x[ i % x.length ], y[ i % y.length ] );
         if ( isnanf( z ) ) {