Description of binary searching and Fibonacci search

Question

Give a brief description of the term binary searching and Fibonacci search?

Answer 1

Binary Search : Binary search is the procedure of locating an element in the sorted list. The search starts by a dividing the list in two parts. The algorithm compares the median value. If the search element is less than median value, the top list only will be searched, after finding out the middle element of that list. The procedure continues till the element is found or the search in top list is complete. The same procedure is continued for the bottom list, till the element is found or the search in the bottom list is finished. If an element is found that should be the median value.

Fibonacci Search : Fibonacci search is a procedure of searching a sorted array by utilizing divide and conquer algorithm. Fibonacci search inspects locations whose addresses have lower dispersion. When the search element has non-uniform access memory storage, the Fibonacci search algorithm diminishes the average time required for accessing a storage location.