For a given sorted array (ascending order) and a target number, find the first index of this number in
O(log n) time complexity. If the target number does not exist in the array, return
If the array is
[1, 2, 3, 3, 4, 5, 10], for given target
Challenge: If the count of numbers is bigger than 232, can your code work properly?