@@ -0,0 +1,1026 @@
+public class findMinShiftedArray %7B%0A    public int findMin(int%5B%5D nums) %7B%0A        /*int low = 0;%0A        int high = nums.length-1;%0A        int mid = (low+high)/2;%0A        %0A        int key = 20;%0A        %0A        while(nums%5Blow%5D%3Cnums%5Bhigh%5D)%7B%0A            if(nums%5Bmid%5D%3Cnums%5Blow%5D)%7B%0A                high=mid;%0A                mid = (low+high)/2;%0A            %7D%0A            else if(nums%5Bmid%5D%3Enums%5Bhigh%5D)%7B%0A                low=mid;%0A                mid=(low+high)/2;%0A            %7D%0A            else%7B%0A                low=mid;%0A                mid=(low+high)/2;%0A            %7D%0A            continue;            %0A        %7D%0A        return nums%5Bmid%5D;*/%0A        int n = nums.length;%0A        switch(n)%7B%0A            case 0:    %0A                return 0;%0A            case 1:%0A                return nums%5B0%5D;%0A            case 2:%0A                return Math.min(nums%5B0%5D,nums%5B1%5D);%0A        %7D%0A        for(int i=1;i%3C=nums.length-1;i++)%7B%0A            if(nums%5Bi%5D%3Cnums%5Bi-1%5D)%7B%0A                return nums%5Bi%5D;%0A            %7D%0A        %7D%0A        return nums%5B0%5D;%0A    %7D%0A%7D%0A

Create findMinShiftedArray.java