0

Evaluate below claims of the problems and their algorithms in terms of possibility, importance and order-optimality.

  • Problem A has worst-case lower bound $\Omega(n^{2})$ and there is an algorithm with $W(n) \in \mathcal{O}(n)$.

  • Problem B has sharp worst-case lower bound $\Omega(n^{2})$ and there is an algorithm with $W(n) \in \mathcal{O}(n)$.

Nash J.
  • 1,235
  • 8
  • 18
  • Welcome to Math SE! What have you tried, and where are you stuck? People may try help you understand things, but generally don't want to do your homework for you. – Austin Weaver Dec 26 '17 at 15:03
  • what is the differences between worst-case lower bound and sharp worst-case lower bound ? –  Dec 26 '17 at 15:07

0 Answers0