tag:blogger.com,1999:blog-959939550345671470.post23998294421858861..comments2024-03-17T12:50:37.677+05:30Comments on C programming Interview questions and answers: Matrix multiplication using recursion in cPriyanka kumarihttp://www.blogger.com/profile/08145649011863585828noreply@blogger.comBlogger6125tag:blogger.com,1999:blog-959939550345671470.post-63405913220402212422017-12-14T09:55:10.916+05:302017-12-14T09:55:10.916+05:30can any one tell me one example which is possible ...can any one tell me one example which is possible by recursion but not by loop and vice versaAnonymoushttps://www.blogger.com/profile/14125778891854161216noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-60942332538982192812016-05-21T06:28:41.753+05:302016-05-21T06:28:41.753+05:30post in your solution or personally mail mepost in your solution or personally mail meAnonymoushttps://www.blogger.com/profile/05053932002749927805noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-87608177438420799462015-10-10T19:17:14.290+05:302015-10-10T19:17:14.290+05:30can anybody help? the code with recursion does not...can anybody help? the code with recursion does not work can u tell me why? or what might be problem?Anonymoushttps://www.blogger.com/profile/06380179378312207917noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-1531916076178124962015-10-10T19:16:56.984+05:302015-10-10T19:16:56.984+05:30can anybody help? the code with recursion does not...can anybody help? the code with recursion does not work can u tell me why? or what might be problem?Anonymoushttps://www.blogger.com/profile/06380179378312207917noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-7976741377509061762014-09-22T00:40:18.127+05:302014-09-22T00:40:18.127+05:30#include
#define MAX 10
int n=3;
int c[MAX][MAX]...#include<br />#define MAX 10<br /><br /><br />int n=3;<br />int c[MAX][MAX]={0};<br />void mult(int a[][3],int b[][3],int i,int j,int k)<br />{<br /> printf("\n%d %d %d",i,j,k);<br /> if(i>n-1)<br /> return;<br />else if(k>n-1)<br />{<br />mult(a,b,i,j+1,0);<br />}<br />else if(j>n-1)<br />{<br />mult(a,b,i+1,0,0);<br />}<br />else<br />{<br /> c[i][j]+=a[i][k]*bdonhttps://www.blogger.com/profile/11027568541107789417noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-73785768281807286062014-09-18T11:25:59.799+05:302014-09-18T11:25:59.799+05:30Give the C++/Java code and time complexity for che...Give the C++/Java code and time complexity for checking whether two indices i and j exist in<br />a sorted array a of integers such that a[i] + a[j] = x for some value x <br /><br />Can some one pliz help with his!!Anonymoushttps://www.blogger.com/profile/05305070810419910429noreply@blogger.com