Apply suggestions from code review

Co-authored-by: Athan <kgryte@gmail.com>
Signed-off-by: Athan <kgryte@gmail.com>

Author: kgryte

lib/node_modules/@stdlib/blas/ext/base/dcartesian-square/README.md

@@ -70,12 +70,13 @@ Note that indexing is relative to the first index. To introduce an offset, use [
 ```javascript
 var Float64Array = require( '@stdlib/array/float64' );
 
-// Initial array...
+// Initial array:
 var x0 = new Float64Array( [ 0.0, 1.0, 2.0, 3.0 ] );
 
-// Create an offset view...
+// Create an offset view:
 var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
 
+// Output array:
 var out = new Float64Array( 8 );
 
 dcartesianSquare( 'row-major', 2, x1, 1, out, 2 );
@@ -127,7 +128,7 @@ dcartesianSquare.ndarray( 2, x, 1, 2, out, 2, 1, 0 );
 
 ## Notes
 
--   For an input array `x` of length `N`, the output array `out` must contain at least `N^2 * LDO` elements.
+-   For an input array of length `N`, the output array must contain at least `N * N * 2` indexed elements.
 -   The `LDO` parameter must be greater than or equal to `max(1,N)`.
 -   If `N <= 0`, both functions return `out` unchanged.
 
@@ -285,7 +286,7 @@ int main( void ) {
 
     // Print the result:
     for ( int i = 0; i < N*N; i++ ) {
-        printf( "out[ %i ] = ( %lf, %lf )\n", i, out[ i*2 ], out[ i*2+1 ] );
+        printf( "out[ %i ] = ( %lf, %lf )\n", i, out[ i*2 ], out[ (i*2)+1 ] );
     }
 }
 ```