Given an array of integers nums sorted in ascending order, and an integer target, search for target within the array. If the target exists, return its 0-based index. Otherwise, return -1.
Your algorithm must run in O(log n) time.
Visualizer will appear here