refactor: optimise loops

---
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/dorg2r/lib/init_unit_columns.js

@@ -18,6 +18,11 @@
 
 'use strict';
 
+// MODULES //
+
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' );
+
+
 // MAIN //
 
 /**
@@ -49,19 +54,36 @@ function initUnitColumns( M, N, K, A, strideA1, strideA2, offsetA ) {
 	var j;
 
 	// Initialize columns k+1:n to columns of the unit matrix
-	ia1 = offsetA + (K*strideA1) + (K*strideA2);
-	ia2 = offsetA + (K*strideA2);
-	da = strideA2 - (M * strideA1);
-	del = strideA1 + strideA2;
+	if ( isRowMajor( [ strideA1, strideA2 ] ) ) {
+		ia2 = offsetA + (K*strideA2);
+		da = strideA1 - ((N-K) * strideA2);
+
+		for ( i = 0; i < M; i++ ) {
+			for ( j = K; j < N; j++ ) {
+				if ( i === j ) {
+					A[ ia2 ] = 1.0;
+				} else {
+					A[ ia2 ] = 0.0;
+				}
+				ia2 += strideA2;
+			}
+			ia2 += da;
+		}
+	} else {
+		ia1 = offsetA + (K*strideA1) + (K*strideA2);
+		ia2 = offsetA + (K*strideA2);
+		da = strideA2 - (M * strideA1);
+		del = strideA1 + strideA2;
 
-	for ( i = K; i < N; i++ ) {
-		for ( j = 0; j < M; j++ ) {
-			A[ ia2 ] = 0.0;
-			ia2 += strideA1;
+		for ( i = K; i < N; i++ ) {
+			for ( j = 0; j < M; j++ ) {
+				A[ ia2 ] = 0.0;
+				ia2 += strideA1;
+			}
+			A[ ia1 ] = 1.0;
+			ia2 += da;
+			ia1 += del;
 		}
-		A[ ia1 ] = 1.0;
-		ia2 += da;
-		ia1 += del;
 	}
 
 	return A;