0
$\begingroup$

Given a set $S$ of $n$ planar points, we know that the $|CH(S)| = 17$. How can I create an algorithm that computes $CH(S)$ in $O(n)$ time? Why is it really $O(n)$?

$\endgroup$
  • 1
    $\begingroup$ en.wikipedia.org/wiki/… $\endgroup$ – D.W. May 30 '18 at 5:32
  • $\begingroup$ @D.W. Thanks. I was thinking the same, the reason why it's $O(n)$ is stupidly simple, $log(17)$ being constant. So I thought maybe I'm missing something. $\endgroup$ – GeomForFun May 30 '18 at 5:48

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.