Member Avatar for sehar004

Can anyone help me with finding the the time complexity of the following algorithm??

for(i =0;i<n;i++)
for(j=o;j<n;j++)
for(k = a[j] = 0; k<n;k++)
a[j] += b[k] * c[k][j];


please!!!! and explain step by step .....

  • 2 Contributors
  • 2 Replies
  • 69 Views
  • 6 Hours Discussion Span
  • Latest Post Latest Post by sehar004
Member Avatar for sehar004

thanks for first link Salem.. and for the second too..

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.