I found this code on this site to find the second largest number:
def second_largest(numbers): m1, m2 = None, None for x in numbers: if x >
I am writing the code which is using recursion to find the second smallest element in a list.
def small(l): small.counter+=1; min=l[0]; emp=[] for i in range(len(l)): if l[i]
You can test it with various input integers.