Question

Suppose that an array A of n 1 numbers is given. We want to create a n x n matrix B such that, for 0 i<j<n, Bli.j] AIk] = Ali]Ali+1] for n ij 0, B[i.j] 0 +Aljl k-i I need to write a program where it accepts A as array and return B as matrix defined above, for O(n 2) algorithm

Can someone please help me in solving question in attached image. Thanks

Answer 1

this program in c++
#include <iostream>

using namespace std;

int main()

{

int n;

cin>>n;

int a[n],c[n][n],b[n][n],i,j;

for(i=0;i<n;i++)   //This for loop run for n times

{

     cin>>a[i];

}

for(i=0;i<n;i++) //This for loop run for n times

{

      int sum=0;

       for(j=0;j<n;j++) //This for loop run for n times

      {

        if(i<=j)

        {

           sum=sum+a[j];

          c[i][j]=sum;

        }

       else

          c[i][j]=0;

      }

}

for(i=0;i<n;i++) //This for loop run for n times

{

      for(j=0;j<n;j++) //This for loop run for n times

      {

           if(i>=j)

             b[i][j]=0;

         else

             b[i][j]=c[i][j];

      }

}

for(i=0;i<n;i++) //This for loop run for n times

{

      for(j=0;j<n;j++) //This for loop run for n times

      {

         cout<<b[i][j];

       }

cout<<endl;

}

return 0;

}

En mo 3 B matrix 10 3 cmatrix TL 3 67 lo 2 s 5 0 0