Explain binary searching, Fibinocci search.
- 5 Answers
- 22874 Views
- CTS, IBM, TCS, I also Faced
- E-Mail Answers
Answer Posted / nipesh.....janghel....bca..2nd
Binary Search
The binary search is the standard method for searching
through a sorted array. It is
much more efficient than a linear search, where we pass
through the array elements in
turn until the target is found. It does require that the
elements be in order.
The binary search repeatedly divides the array in two, each
time restricting the search to
the half that should contain the target element.
In this example, we search for the integer 5 in the 10-
element array below:
2 : 5 : 6 : 8 : 10 : 12 : 15 : 18 : 20 : 21
Loop 1 - Look at whole array
Low index = 0, high index = 9
Choose element with index (0+9)/2 = 4
Compare value (10) to target
10 is greater than 5, so the target must be in the lower
half of the array
Set high index = (4-1) = 3
Loop 2
Low index = 0, high index = 3
Choose element with index (0+3)/2 = 1
Compare value (5) to target
5 is equal to target
Target was found, index = 1
| Is This Answer Correct ? | 23 Yes | 4 No |
Post New Answer View All Answers
Is complete binary tree?
What is the prerequisite for binary searching?
Which sorting does collections sort use?
Why is it important to sort waste?
What is scalar data type?
Is arraylist synchronized?
Do you know how to find if linked list has loop?
Which sorting technique is best in worst case?
Tell me the difference between structure and array?
Which is better bubble sort or selection sort?
Why is sorting important?
Does set allow null values?
How will you reverse Linked List.
Can treeset contain duplicates?
How do you find the size of an arraylist?
