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
~116 People Reached
Favorite Forums
Computer Science
x
1
|
What would be the time complexity (worst case) of following: I have three loopes. n=number of elements for(i=0;i<n-2;i++) for(j=i+1;j<n-1;j++) for(k=j+1;k<n;k++) If only i and j loop were there the time complexity would be O(n^2-n/2) but considering the 3rd loop i got kind a lost. So please help me!
|