Java solution using Recursion
```\nclass Solution {\n    public int minMaxGame(int[] nums) {\n        int n = nums.length;\n        if (n==1){\n            return nums[0];//Break statement o
```\nclass Solution {\n    public int minMaxGame(int[] nums) {\n        int n = nums.length;\n        if (n==1){\n            return nums[0];//Break statement of Recursion\n        }\n            int[] newNums = new int[n/2];//Making an array of half of the size\n            for (int i = 0; i <n/2 ; i++) {\n                if (i%2==0){//For even numbers\n                    newNums[i] = Math.min(nums[2 * i], nums[2 * i + 1]);\n                }else{//For odd numbers\n                    newNums[i] = Math.max(nums[2 * i], nums[2 * i + 1]);\n                }\n            }\n        if (newNums.length>1){\n            return minMaxGame(newNums);//Using recursion for the next iteration untill we reach to array of length 1\n        } return newNums[0];\n    }\n}
['Recursion', 'Java']