@@ -0,0 +1,1203 @@
+/**%0A * Company%0A * Copyright (C) 2014-2017 All Rights Reserved.%0A */%0Apackage com.cwenao.trying.array;%0A%0A/**%0A * @author cwenao%0A * @version $Id FindMinimunForSortedAndRotated.java, v 0.1 2017-08-02 23:54 cwenao Exp $$%0A */%0Apublic class FindMinimunForSortedAndRotated %7B%0A%0A    public int findMinimun(int%5B%5D array, int low, int high) %7B%0A%0A        if (low %3E high) %7B%0A            return array%5B0%5D;%0A        %7D%0A%0A        if (low == high) %7B%0A            return array%5B0%5D;%0A        %7D%0A%0A        int mid = (high - low) / 2 + low;%0A%0A        if (mid %3C high && array%5Bmid%5D %3E array%5Bmid + 1%5D) %7B%0A            return array%5Bmid + 1%5D;%0A        %7D%0A        if (mid %3E low && array%5Bmid%5D %3C array%5Bmid - 1%5D) %7B%0A            return array%5Bmid%5D;%0A        %7D%0A%0A        if (array%5Bhigh%5D %3E array%5Bmid%5D) %7B%0A            return findMinimun(array, low, mid - 1);%0A        %7D%0A%0A        return findMinimun(array, mid + 1, high);%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        int%5B%5D array = %7B15, 18, 2, 3, 6, 12%7D;%0A        FindMinimunForSortedAndRotated findMinimunForSortedAndRotated = new FindMinimunForSortedAndRotated();%0A        int minimun = findMinimunForSortedAndRotated.findMinimun(array, 0, array.length - 1);%0A        System.out.println(minimun);%0A    %7D%0A%0A%7D%0A

add the find minimun value for sorted and rotated array