1. Engineering
  2. Computer Science
  3. consider an algorithm that takes a time in to solve...

Question: consider an algorithm that takes a time in to solve...

Question details

Consider an algorithm that takes a time in \theta(n^{ln3}) to solve instances of size n.

Is it correct to say that it takes a time in O(n^{1.59}) ? In \Omega (n^{1.59}) ? In \theta (n^{1.59}) ?

Justify your answers

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution