Download to read offline
![Algorithm of Binary search
It can be done by the following step:
1. get the middle element
MID= INT((BEG+END)/2)
2. if the middle element equals to the searched value, the algorithm stops.
3.Otherwise
a)If Item<DATA[MID],then appear left half
DATA[BEG]…….DATA[MID-1]
b)If item>DATA[MID],then appear right half
DATA[BEG]…….DATA[MID+1]](https://image.slidesharecdn.com/binarysearch-200312062402/85/Binary-search-in-data-structure-3-320.jpg)
![Algorithm of Binary search
It can be done by the following step:
1. get the middle element
MID= INT((BEG+END)/2)
2. if the middle element equals to the searched value, the algorithm stops.
3.Otherwise
a)If Item<DATA[MID],then appear left half
DATA[BEG]…….DATA[MID-1]
b)If item>DATA[MID],then appear right half
DATA[BEG]…….DATA[MID+1]](https://image.slidesharecdn.com/binarysearch-200312062402/75/Binary-search-in-data-structure-3-2048.jpg)
Uploaded byMeherul1234
Binary search in data structure
Binary search is a fast search algorithm that works on sorted data by comparing the middle element of the collection to the target value. It divides the search space in half at each step to quickly locate an element. The algorithm gets the middle element, compares it to the target, and either searches the left or right half recursively depending on if the target is less than or greater than the middle element. An example demonstrates finding the value 23 in a sorted array using this divide and conquer approach.
In this document
Powered by AI
The presentation defines binary search, a fast search algorithm using divide and conquer, which requires sorted data. An example illustrates its application on a sorted array of ten elements.
More Related Content
![Data Structures - Lecture 8 [Sorting Algorithms]](https://cdn.slidesharecdn.com/ss_thumbnails/lecture-8sortingalgorithms-150205105023-conversion-gate02-thumbnail.jpg?width=600ounds&width=560&fit=bounds)
Similar to Binary search in data structure
Binary search in data structure
- 1. OBJECTIVE OF PRESENTATION •Define Binary search. • Example and solve with Binary search.
- 2. Binary search • Binarysearch is a fast search algorithm with run-time complexity. • This search algorithm works on the principle of divide and conquer. • For this algorithm to work properly, the data collection should be in the sorted form. • Binary search looks for a particular item by comparing the middle most item of the collection.
- 3. Algorithm of Binarysearch It can be done by the following step: 1. get the middle element MID= INT((BEG+END)/2) 2. if the middle element equals to the searched value, the algorithm stops. 3.Otherwise a)If Item<DATA[MID],then appear left half DATA[BEG]…….DATA[MID-1] b)If item>DATA[MID],then appear right half DATA[BEG]…….DATA[MID+1]
- 4. EXAMPLE Let DATA bethe following sorted 10 element array: DATA: 2,5,8,12,16,23,38,56,72,91 Find ITEM=23.
- 5. End of thepresentation Thank You