C
codefixer
Hello:
I have seen that many interviewers ask, so what is the Big O for that
algorithm (say Binary Search) which is o(log n) + 1 (in most cases).
I know what is the Big O for most algorithms, but I am wondering how
can one derive the same ? I want to know if any places on the web have
concrete proof or methodology to do so.
Because of this Big O I have almost failed in an interview but my
conscience refused to answer the question by memorization as I really
don't know how to derive it mathematically.
Sorry I am unable to afford a Data Structure course or buy expensive
books. So if you know any good links kindly share else ignore this
e-mail.
Sorry for the spam if it's offtopic.
Thanks you.
I have seen that many interviewers ask, so what is the Big O for that
algorithm (say Binary Search) which is o(log n) + 1 (in most cases).
I know what is the Big O for most algorithms, but I am wondering how
can one derive the same ? I want to know if any places on the web have
concrete proof or methodology to do so.
Because of this Big O I have almost failed in an interview but my
conscience refused to answer the question by memorization as I really
don't know how to derive it mathematically.
Sorry I am unable to afford a Data Structure course or buy expensive
books. So if you know any good links kindly share else ignore this
e-mail.
Sorry for the spam if it's offtopic.
Thanks you.