Search in Rotated Sorted Array

There is an integer array nums sorted in ascending order (with distinct values).
Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed). For example, [0,1,2,4,5,6,7] might be rotated at pivot index 3 to become [4,5,6,7,0,1,2].
Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.

1 <= nums.length <= 5000
-10^4 <= nums[i] <= 10^4
All values of nums are unique.
nums is an ascending array that has been rotated between 1 and 5000 times.
-10^4 <= target <= 10^4

Initialize two pointers, left and right, to the start and end of the array, respectively.
While left is less than or equal to right, calculate the middle index mid.
If the element at mid is equal to target, return mid.
If the left half of the array is sorted, check if the target is in the sorted half. If it is, move the right pointer to mid - 1. Otherwise, move the left pointer to mid + 1.
If the right half of the array is sorted, check if the target is in the sorted half. If it is, move the left pointer to mid + 1. Otherwise, move the right pointer to mid - 1.
If the target is not found, return -1.