Top Questions

1. Why is that, the base of the logarithm is always taken as 2 in finding time complexity of algorithms?
   2 votes

   3 answers
2. How to find if an algorithm takes pseudopolynomial time??
   2 votes

   1 answers