Introduction to Complexity Theory/Big O Algorithm Analysis/Quiz

<quiz display=simple> {Which of the following is the most efficient? | type="()"} - $O\left(2^n\right)$ + $O(\log \left(n\right))$ - $O\left(n^3\right)$ - $O\left(4n^3\right)$

{In how many steps would the binary search algorithm halt if it were to search for the value $17$, in the set $S=\{2,3,5,7,11,13,17,19,23\}$? |type="{}"} { 2 | two | Two | TWO | tWo | twO | tWO | TwO | TWo }

{What is the big O of the algorithm mentioned in the previous question? |type="()"} + $O(\log \left(n\right))$ - $O\left(n\right)$ - $O\left(c\right)$ - $O\left(n\log \left(n\right)\right)$

</quiz>