Joined
Last Seen
0 Reputation Points
Unknown Quality Score
No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
0 Endorsements
Ranked #107.41K
~77 People Reached
Favorite Forums
Computer Science
x
1
|
I have two snippets of code that I am having a lot of trouble with finding the closed form Summations and time complexities for: x=0; for(i=1;i< pow(2,N); i = 2*i + 2){ for(j=1;j<N ; j++){ x=x+j; } } and: x=0; for(i=1;i <= (2*n); i++){ for(j=1; j <= n; j++){ if(j<i) …
|