Search in Rotated Sorted Array

My Approach Explanation:

1.Firstly array is sorted then It was rotated so i used binary search because it search the elements by spliting it.
2.At each step that I compare the elements so I can search in half of the array which is sorted.
3.Its like if the target is in with the sorted half then I continue searching in that half otherwise I move to the other half of the array.
4.This process continues until the target is found or it didn't element to search further.

Methods Used:
Binary Search