NVIDIA Interview Question

Big O for binary search.

Interview Answers

Anonymous

Oct 10, 2013

log2(N)

Anonymous

Jan 26, 2014

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

1