Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Sheth Nisarg
4
votes
1
answer
1
Time complexity
Find the time complexity of the below function: function(int n){ for(int i=0;i<n;i++) for(int j=1; j<i*i; j++) if(j%i==0){ for(int k=0;k<j;k++) printf("*"); } }
Find the time complexity of the below function:function(int n){for(int i=0;i<n;i++) for(int j=1; j<i*i; j++) if(j%i==0){ for(int k=0;k<j;k++) ...
582
views
asked
Aug 13, 2017
Algorithms
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register