Pergunta de entrevista da empresa NVIDIA

Big O for binary search.

Respostas da entrevista

Sigiloso

10 de out. de 2013

log2(N)

Sigiloso

26 de jan. de 2014

O(log(n)) because for each iteration you break down the traversal into half.

1