1 votes 1 votes Is this the correct way to solve ? Q) int algorithm(int n) { int sum =0;k,j; for (k=0;k<n/2;k++) for(j=0;j<10;j++) sum++; return 4*algorithm(n/2)*algorithm(n/2)+algorithm(n/2)*algorithm(n/2) } Algorithms time-complexity algorithms recurrence-relation + – syncronizing asked Mar 15, 2019 • retagged Mar 19, 2019 by Devshree Dubey syncronizing 1.3k views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments syncronizing commented Mar 16, 2019 reply Follow Share @Shaik Masthan now my doubt is clear, thanks a lot 1 votes 1 votes Devshree Dubey commented Mar 19, 2019 reply Follow Share @Shaik Masthan,Bhai but in above example the code has been used 3 times. However,since 4*T(n/2) has been mentioned therefore,the code used 4 times. Am I right? 0 votes 0 votes Shaik Masthan commented Mar 20, 2019 reply Follow Share noo brother, read one more time the previous comments ! is it 3 times or 4 times used check ome more time ? 0 votes 0 votes Please log in or register to add a comment.