Register

doubts

225 views
0 votes
0 votes
how to solve algorithm problems(the first section of problems in go book)  on my own ? seems very tough.plz suggest some solutions.
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
lalitver10 asked Jan 4, 2022
616 views
Self doubts
T(n)=T(n/5)+T(7n/10)+an a: constant what will be the time complexity of the above recurrence relation?? Please share the approach for this kind of recurrence relation
T(n)=T(n/5)+T(7n/10)+ana: constantwhat will be the time complexity of the above recurrence relation??Please share the approach for this kind of recurrence relation
User Avatar
0 votes
0 votes
0 answers
2
_Madhuri asked Nov 22, 2021
228 views
Self doubts
Large(n) { If(n<=1) Return n; Sum=0; For i=0 to n-1 Sum=Sum+Large(i); Return Sum; } What will be its time complexity??
Large(n){If(n<=1)Return n; Sum=0;For i=0 to n-1Sum=Sum+Large(i);Return Sum; }What will be its time complexity??
User Avatar
0 votes
0 votes
0 answers
3
Daulat48 asked Jan 19, 2019
281 views
Self doubts
T(n)=T(√n) + n, n>2 =1 , n<= 2 Solution = ?
T(n)=T(√n) + n, n>2 =1 , n<= 2Solution = ?
User Avatar
0 votes
0 votes
1 answer
4
altamash asked Nov 11, 2018
360 views
DYNAMIC PROGRAMMING [self doubts]
how to form The minimum number of scalar multiplications to find the product B1 B2 B3 B4 B5 using the Matrix Chain Multiplication method
how to form The minimum number of scalar multiplications to find the product B1 B2 B3 B4 B5 using the Matrix Chain Multiplication method
User Avatar
Link Copied!