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
Answers by EKANSH
2
votes
1
How to determine the time complexity of this loop?
// func() is any constant root function for (int i = n; i > 0; i = func(i)) { // some O(1) expressions or statements } "In this case, i takes values n, n1/k, (n1/k)1/k = n1/k2, ... do we calculate that there are logk(log(n)) iterations? Source: http://www.geeksforgeeks.org/time-complexity-loop-loop-variable-expands-shrinks-exponentially/
// func() is any constant root functionfor (int i = n; i 0; i = func(i)){ // some O(1) expressions or statements}"In this case, i takes values n, n1/k, (n1/k)1/k = n1/...
1.0k
views
answered
Feb 19, 2018
Algorithms
algorithms
asymptotic-notation
time-complexity
space-complexity
non-gate
+
–
0
votes
2
GATE2016 CE-2: GA-5
The sum of the digits of a two digit number is $12$. If the new number formed by reversing the digits is greater than the original number by $54$, find the original number. $39$ $57$ $66$ $93$
The sum of the digits of a two digit number is $12$. If the new number formed by reversing the digits is greater than the original number by $54$, find the original numbe...
1.8k
views
answered
Apr 27, 2017
Quantitative Aptitude
gate2016-ce-2
quantitative-aptitude
numerical-computation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register