+Binary Search is an efficient [search algorithm](/wiki/Search_Algorithm) for finding an item in a sorted list. It works by repeatedly dividing the search interval in half, quickly narrowing down the possible locations until the target is found or its absence confirmed, significantly outperforming a [Linear Search](/wiki/Linear_Search).
+## See also
+- [Algorithm](/wiki/Algorithm)
+- [Data Structure](/wiki/Data_Structure)
+- [Sorting Algorithm](/wiki/Sorting_Algorithm)
... 1 more lines