refactor: use manual loops instead of loop reordering

---
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: passed
  - 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: na
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: na
  - task: lint_typescript_tests
    status: na
  - task: lint_license_headers
    status: passed
---

Author: aayush0325

lib/node_modules/@stdlib/lapack/base/dlange/lib/base.js

@@ -23,7 +23,6 @@
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
 var dlassq = require( '@stdlib/lapack/base/dlassq' ).ndarray;
 var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' );
-var loopOrder = require( '@stdlib/ndarray/base/nullary-loop-interchange-order' );
 var dasum = require( '@stdlib/blas/base/dasum' ).ndarray;
 var Float64Array = require( '@stdlib/array/float64' );
 var min = require( '@stdlib/math/base/special/min' );
@@ -140,30 +139,35 @@ function maxAbs( M, N, A, strideA1, strideA2, offsetA ) {
 	var value;
 	var temp;
 	var da0;
+	var sa1;
+	var sa2;
 	var da1;
 	var ia;
-	var sa;
-	var sh;
-	var S0;
 	var S1;
-	var o;
+	var S2;
 	var i;
 	var j;
 
 	value = 0.0;
 
-	// Resolve the loop interchange order:
-	o = loopOrder( [ M, N ], [ strideA1, strideA2 ] );
-	sh = o.sh;
-	sa = o.sx;
-	S0 = sh[ 0 ];
-	S1 = sh[ 1 ];
-	da0 = sa[ 0 ];
-	da1 = sa[ 1 ] - ( S0*sa[0] );
+	if ( isRowMajor( strideA1, strideA2 ) ) {
+		S1 = M;
+		S2 = N;
+		sa1 = strideA1;
+		sa2 = strideA2;
+	} else {
+		S1 = N;
+		S2 = M;
+		sa1 = strideA2;
+		sa2 = strideA1;
+	}
+
+	da0 = sa2;
+	da1 = sa1 - (S2 * sa2);
 	ia = offsetA;
 
 	for ( i = 0; i < S1; i++ ) {
-		for ( j = 0; j < S0; j++ ) {
+		for ( j = 0; j < S2; j++ ) {
 			temp = A[ ia ];
 			if ( value < temp || isnan( temp ) ) {
 				value = temp;