Very Simple Java Binary Search
public class Solution {\n    public int findMin(int[] num) {\n        int low = 0;\n        int high = num.length - 1;\n        while(low < high){\n            
    public class Solution {\n    public int findMin(int[] num) {\n        int low = 0;\n        int high = num.length - 1;\n        while(low < high){\n            int mid = (low + high) / 2;\n            if(num[high] < num[mid]){\n                low = mid + 1;\n            } else {\n                high = mid;\n            }\n        }\n        return num[high];\n    }\n}
['Binary Tree', 'Java']