Quick Facts Efficient search algorithm. Time: \(O(log n)\) Space: \(O(1)\).Quickly find an element in a sorted list of elements. References https://www.geeksforgeeks.org/binary-search/https://en.wikipedia.org/wiki/Binary_search_algorithmhttps://github.com/raywenderlich/swift-algorithm-club/tree/master/Binary%20Search Tags:AlgorithmsGIPSwift