Binary Search

Term side of the Card
Topic: Search Algorithms
Unit title: Binary Search
Categories: Algorithm
Explanation side of the Card

Explanation: The efficient search algorithm that locates an item in a sorted array by repeatedly halving the search interval. Works only on sorted data, achieving O(log n) complexity.

Edit on GitHubContributions in our content repository are 🤗 welcome from everyone.Link leads to the Contributions guidelines on GitHubLink leads to the content repository on GitHub