Binary Search • Easy
Binary Search
Given an array of integers `nums` which is sorted in ascending order, and an integer `target`, write a function to search `target` in `nums`. If `target` exists, then return its index. Otherwise, return -1.
The Challenge
Given an array of integers `nums` which is sorted in ascending order, and an integer `target`, write a function to search `target` in `nums`. If `target` exists, then return its index. Otherwise, return -1.
Pro-tip: Use low and high pointers to repeatedly divide the search interval in half.
Solution.swift Tests.swift
Output
Ready to run.