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 loki2023
2
votes
0
answers
1
I-Gate Question
Consider the following algorithm, Dosomething( x, n) { m= n, temp= 1,z= x; while(m>0) do { while((m mod z)=0) do { m= Floor(m/2); z=z^2; } m = m-1, temp= temp* z; } return temp; } The complexity of above algorithm is Theta(log n) Theta(n log n) Theta(n^2) Theta(n)
Consider the following algorithm,Dosomething( x, n){m= n, temp= 1,z= x;while(m>0) do{while((m mod z)=0) do{m= Floor(m/2);z=z^2;}m = m-1, temp= temp* z;}return temp;}The c...
366
views
asked
Aug 23, 2022
Algorithms
algorithms
time-complexity
i-gate-test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register