Prove the complexity of binary search is O(n^2)
No Germans allowed
>inb4 a German computer engineer comes and cheats somehow
the complexity of binary search is O(n^2) because the bible said so.
q.e.d.
>>50794166
/g/ is not your algorithms homework tutor
but it's not
>>50794686
Yes it is. Look up the definition of Big-Oh.
>>50794505
wow rude
wtf are you talking about
complexity of bin search is O(log(n))
>>50794166
O(n^2)?
wow anon are you retarded or something? that's so easy.
>>50794166
>so we didn't bother
lol'd
>>50795676
>>50794686
>>50795677
>what is an upper bound
You're thinking about big-theta, not big-oh
>>50795731
do yourself a favor and drop out and switch to IT anon, you're not cut out for cs
>>50795868
http://stackoverflow.com/questions/3230122/big-oh-vs-big-theta
>>50794166
There exists some constants C and n0 such that Cn^2 > log(n) for all n>n0
