There are a few ways to search a rotated array. One way is to use the binary search algorithm. This algorithm works by dividing the array in half and searching for the element in the middle. If the element is found, then the algorithm terminates. If the element is not found, the algorithm splits the array in half again and searches for the element in the middle of that subarray. This process is repeated until the element is found or the array is reduced to a single element.
