Improve a given function so that it runs in O(log n) time in Swift
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
Swift
🤖 Code Explanation
This is a binary search algorithm. It takes an array of integers and a key integer and returns true if the key is found in the array and false if it is not.
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
More problems solved in Swift
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)
![](https://cdn-icons-png.flaticon.com/512/5968/5968371.png)