JAVA || 0ms || 100% Faster || Using Recursion
class Solution {\n    public int minMaxGame(int[] nums) {\n        return recursion(nums);\n    }\n    \n    public int recursion(int[] nums){\n        \n      
class Solution {\n    public int minMaxGame(int[] nums) {\n        return recursion(nums);\n    }\n    \n    public int recursion(int[] nums){\n        \n        if(nums.length==1){\n            return nums[0];\n        }\n        int[] temp = new int[nums.length/2];\n        int count=0;\n        int index=0;\n        for(int i=0;i<nums.length-1;i+=2){\n            if(count%2==0){\n                temp[index] = Math.min(nums[i],nums[i+1]);\n            }else{\n                temp[index] = Math.max(nums[i],nums[i+1]);\n            }\n            count++;\n            index++;\n        }\n        //System.out.println(Arrays.toString(temp));\n        return recursion(temp);\n    }\n}
['Recursion', 'Java']