Loading...
Engaged employer
Big O for binary search.
Anonymous
log2(N)
O(log(n)) because for each iteration you break down the traversal into half.
Check out your Company Bowl for anonymous work chats.
Get actionable career advice tailored to you by joining more bowls.
Stay ahead in opportunities and insider tips by following your dream companies.
Get personalised job recommendations and updates by starting your searches.