Search-in-Rotated-Sorted-Array

Search in Rotated Sorted Array

Difficulty:Medium

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

Code

Java Runtime: 340 ms

public class Solution {    public int search(int[] nums, int target) {        for(int i = 0; i < nums.length; i++)            if(target == nums[i])                return i;        return -1;    }}

C Runtime: 0 ms

int search(int* nums, int numsSize, int target) {    for(int i = 0; i < numsSize; i++)        if(nums[i] == target)            return i;    return -1;}