Suppose that, even unrealistically, we are to search a list
of 700 million items using Binary Search, Recursion (the
algorithm given in class). What is the maximum number of
comparisons that this algorithm must perform before finding
a given item or concluding that it is not in the list?
- 1 Answers
- 3712 Views
- I also Faced
- E-Mail Answers
Answer Posted / Nirmal Singh
In the worst-case scenario for binary search, when the searched item is at the end of the sorted list, the algorithm would need to perform log2(700 million) = 28 comparisons before finding the item or concluding that it is not in the list.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
can u give me the information about the questions asked by the bally in campus
what are the main points to be included in our introduction when asked in hr...??
What is Campus selection process of patni at Adcet,Ashta at 24th dec 2010.Also give apti syllabus.
Please explain why you are suitable for the position that you have applied for?
I am looking for NIC Scientific Officer / Engineer-SB (Programmer)Sample papers or any portion of questions/ syllabus plz, send me on sengupta.pranab@gmail.com. Regards PRANAB
I have applied for the post of Section Engineer. plz anyone send me the previous question paper. i did my engineering in Information Technology.
What is the instruction to load the register B?
plz snd me sbi probationofficers papers to my id archpa@gmail.com
Hi i want some previous interview questions and answers for KVB Bank.
What would be your first invention?
why c is called middle level langauge?
pls send me the e-book for verbal and non verbal reasoning of R S aggarwall
Why do you want to work here
i need the placement paper of ford IT service...
What have you done to improve or develop your knowledge / professional qualifications in the last year?
