Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
afroze
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by afroze
0
votes
1
answer
1
complexity of a function
Find the complexity of the below function: function (int n){ for (int i=0;i<n;i++) for (int j=i;j<i*i;j++) if(j%i==0){ for(int k=0;k<j;k++) printf("*"); } }
Find the complexity of the below function:function (int n){for (int i=0;i<n;i++) for (int j=i;j<i*i;j++) if(j%i==0){ for(int k=0;k<j;k++) ...
330
views
asked
May 4, 2022
1
votes
1
answer
2
Self doubt
what is significance of loop Invariant? when we use a loop in an algo we check it , if it properly runs then fix it in that, then why do check separately loop invariant ?
what is significance of loop Invariant?when we use a loop in an algo we check it , if it properly runs then fix it in that, then why do check separately loop invariant ?
552
views
asked
Nov 4, 2021
Algorithms
algorithms
sorting
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register