How to resolve the algorithm Sum of elements below main diagonal of matrix step by step in the 11l programming language

Published on 12 May 2024 09:40 PM

#11l

How to resolve the algorithm Sum of elements below main diagonal of matrix step by step in the 11l programming language

Table of Contents

Problem Statement
Step by Step Solution
Sourcecode

Problem Statement

Find and display the sum of elements that are below the main diagonal of a matrix. The matrix should be a square matrix.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Sum of elements below main diagonal of matrix step by step in the 11l programming language

Source code in the 11l programming language

F sumBelowDiagonal(m)
   V result = 0
   L(i) 1 .< m.len
      L(j) 0 .< i
         result += m[i][j]
   R result

V m = [[ 1,  3,  7,  8, 10],
       [ 2,  4, 16, 14,  4],
       [ 3,  1,  9, 18, 11],
       [12, 14, 17, 18, 20],
       [ 7,  1,  3,  9,  5]]

print(sumBelowDiagonal(m))

You may also check:How to resolve the algorithm Sorting algorithms/Cocktail sort step by step in the Euphoria programming language
You may also check:How to resolve the algorithm Currying step by step in the Hy programming language
You may also check:How to resolve the algorithm Create an HTML table step by step in the Lua programming language
You may also check:How to resolve the algorithm Enforced immutability step by step in the Racket programming language
You may also check:How to resolve the algorithm Count the coins step by step in the Ruby programming language