AISD - Lab2.1

#O(n)

def findSecondLargest(arr, index, largest, secondLargest):
    if(index == len(arr)):
        return secondLargest
    element = arr[index]
    if(element > secondLargest):
        if(element > largest):
            return findSecondLargest(arr, index + 1, element, largest)
        else:
            return findSecondLargest(arr, index + 1, largest, element)
    return findSecondLargest(arr, index + 1, largest, secondLargest)

findSecondLargest([0,10,5,7,8], 0, None, None)