SearchRotatedArray.cs

// https://leetcode.com/problems/search-in-rotated-sorted-array/submissions/

public class Solution
{
    public int Search(int[] nums, int target)
    {
        if (nums.Length == 0)
            return -1;
        int pivot = FindMin(nums);
        int start = 0;
        int end = nums.Length - 1;
        int x = ((start + end + 1) / 2) % nums.Length; // x represents the virtual index if it was non pivoted.

        int i; // i represents the true index.

        while (start <= end)
        {
            i = (x + pivot) % nums.Length;
            if (nums[i] == target)
            {
                return i;
            }
            if (nums[i] > target)
            {
                // Its to the left
                end = x - 1;
            }
            else
            {
                // Its to the right
                start = x + 1;
            }
            x = ((start + end + 1) / 2) % nums.Length;
        }
        return -1;
    }
    public int FindMin(int[] nums)
    {
        int start = 0;
        int end = nums.Length - 1;
        int x = ((start + end + 1) / 2) % nums.Length;
        while (true)
        {
            if (nums[(x + nums.Length - 1) % nums.Length] >= nums[x])
            {
                return x;
            }
            if (nums[x] >= nums[0])
            {
                // its to the right
                start = x + 1;
            }
            else
            {
                // Its to the left
                end = x - 1;
            }
            x = ((start + end + 1) / 2) % nums.Length;
        }
    }
}