Binary search
id:
binary-search-165-851424
title:
Binary search
text:
In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the remaining half, again taking the middle element to compare to the target value, and repeating this until the target valu
brand slug:
wiki
category slug:
encyclopedia
description:
Search algorithm finding the position of a target value within a sorted array
original url:
https://en.wikipedia.org/wiki/Binary_search
date created:
2001-09-27T14:01:54Z
date modified:
2024-08-29T16:13:12Z
main entity:
{"identifier":"Q243754","url":"https://www.wikidata.org/entity/Q243754"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/8/83/Binary_Search_Depiction.svg","width":470,"height":200}
fields total:
13
integrity:
16