Beats 100% Runtime || Recursive Approach
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int minMaxGame(int[] nums) {\n        if(nums.length == 1)\n            return nums[0];\n        int arr[] = new int[nums.length/2];\n        boolean flag = false;\n        int ind = 0;\n        for(int i=0; (i+1)<nums.length; i+=2){\n            if(!flag){\n                arr[ind++] = Math.min(nums[i], nums[i+1]);\n                flag = true;\n            }\n            else{\n                arr[ind++] = Math.max(nums[i], nums[i+1]);\n                flag = false;\n            }\n        }\n        return minMaxGame(arr);\n    }\n}\n```
['Recursion', 'Java']