Computer Science Homework Help

I’m working on a algorithms & data structures discussion question and need an explanation and answer to help me learn.

Explain how polynomial (n^k), exponential (k^n) runtime complexity can be converted into logarithmic (logn) and

then constant time complexity and the necessary change in the implementations. [Hint: application of different types of data structures, algorithms etc.)