• recategorized by
730 views

1 Answer

0 0 votes
Logic of DSA remains same, so just go little through the syntax and semantics of both languages.
Position:
Show:

Related questions

1 1 vote
1 1 answer
677
677 views
Çșȇ ʛấẗẻ asked Dec 21, 2016
677 views
When and why AVL trees are preferred over Binary Search Tree ?
0 0 votes
0 0 answers
322
322 views
Crackca asked Sep 6, 2021
322 views
What is the worst-case time complexity to find attribute closure of a set of elements?i.e. Let find attribute closure for {AB}+R(A,B,C,D,E,F,G,H,I,….. up to k time){A → B...
1 1 vote
1 1 answer
1.9k
1.9k views
0 0 votes
0 0 answers
456
456 views
aniketpatil32 asked May 11, 2019
456 views
T(n)=T(√n) + n I am finding it difficult to solve last step of this recurrence relation . Please help me with expansion of this recurrence relation.