I tried the following approach to calculate the second largest element in an array using recursion. If there exists no second largest element , then return -1 eg -> [12,12,12