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 .....
sehar004
0
Newbie Poster
Recommended Answers
Jump to Posthttp://www.daniweb.com/forums/thread267064.html
> Can anyone help me with finding the the time complexity of the following algorithm??
http://www.catb.org/~esr/faqs/smart-questions.html#prune
All 2 Replies
Salem
5,138
Posting Sage
http://www.daniweb.com/forums/thread267064.html
> Can anyone help me with finding the the time complexity of the following algorithm??
http://www.catb.org/~esr/faqs/smart-questions.html#prune
sehar004
0
Newbie Poster
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.