Simple Java Solution
public int findMin(int[] nums) {\n        \n        \tint start = 0, end = nums.length - 1, mid;\n        \twhile (start  <  end) {\n        \t\tmid = (start + 
    public int findMin(int[] nums) {\n        \n        \tint start = 0, end = nums.length - 1, mid;\n        \twhile (start  <  end) {\n        \t\tmid = (start + end) / 2;\n        \t\tif (nums[mid]  > nums[end])\n        \t\t\tstart = mid + 1;\n        \t\telse\n        \t\t\tend = mid;\n        \t}\n        \treturn nums[start];\n    }
[]