Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching, Fibinocci search.
- 5 Answers
- 23595 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
What are b tree keys?
Can hashset contain duplicates?
What are the tasks performed during inorder traversal?
How do you get placements?
Can we store a string and integer together in an array?
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
What is meant by int?
What is the need of sorting?
Why is sorting necessary?
Define red-black trees.
What is a stable sort?
What is binary tree? Explain its uses.
What is significance of ” * ” ?
Describe tree database. Explain its common uses.
What is insertion sort technique?
