Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.

Question

In algorithms, what is the big-O time complexity of an algorithm that shrinks the input size in half on each iteration (e.g. finding an element in a sorted array)?

Answer

O(logn)

^^ note that logn is, log base2 n

^^ note that logn is, log base2 n

Question

In algorithms, what is the big-O time complexity of an algorithm that shrinks the input size in half on each iteration (e.g. finding an element in a sorted array)?

Answer

?

Question

In algorithms, what is the big-O time complexity of an algorithm that shrinks the input size in half on each iteration (e.g. finding an element in a sorted array)?

Answer

O(logn)

^^ note that logn is, log base2 n

^^ note that logn is, log base2 n

If you want to change selection, open document below and click on "Move attachment"

status | not learned | measured difficulty | 37% [default] | last interval [days] | |||
---|---|---|---|---|---|---|---|

repetition number in this series | 0 | memorised on | scheduled repetition | ||||

scheduled repetition interval | last repetition or drill |

Do you want to join discussion? Click here to log in or create user.