I was wondering what the computational complexity of this function would be?
2^(log(n)-1)
the log is base 2.
I was wondering what the computational complexity of this function would be? 2^(log(n)-1) the
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I was wondering what the computational complexity of this function would be?
2^(log(n)-1)
the log is base 2.
It depends on using what algorithm you calculate all the logarithms and powers. If you’re smart enough to notice that this function is essentially a division by 2, then you can implement this in constant time (i. e.
O(1)) for integers by doing a right shift.