As we have seen, linear search has a complexity of O(n), while binary search has a complexity of O(log n). This means that binary search will be much faster than linear search for large arrays.