Posts
 
Reputation
Joined
Last Seen
Strength to Increase Rep
+0
Strength to Decrease Rep
-0
0% Quality Score
Upvotes Received
0
Posts with Upvotes
0
Upvoting Members
0
Downvotes Received
3
Posts with Downvotes
2
Downvoting Members
2
1 Commented Post
0 Endorsements
Ranked #72.7K
~178 People Reached
Favorite Forums
Member Avatar for santhi1986

hey some one help me out in calculation O(n) int koodle (int n) { int j,k:int x; if(n%2==0) for(j=0;j<n;j++) x+=rand()%2; else for(k=0;k<n;k++) x+=rand()%2; return x; } I need to obtain the time complexity of the above matrix transpose algorithm using program step count method. Thanks for any help I can …

Member Avatar for srabasti
-2
178