LeetCode Solutions/Binary Search Study Plan/Binary Search I/Search in Rotated Sorted Array.java
<reponame>DevashishPathrabe/LeetCode<filename>LeetCode Solutions/Binary Search Study Plan/Binary Search I/Search in Rotated Sorted Array.java<gh_stars>0class Solution {
    public int search(int[] nums, int target) {
        for(int i=0; i<nums.length; i++){
            if(nums[i] == target){
                return i;
            }
        }
        return -1;
    }
}