[Recursive implementation of bubble sort (python)]

Recursive implementation of bubble sort:

def bubbleSort_Recursion(arr, size):
    if (size < 2):
        return
    for i in range(1,size):
        if (arr[i-1] > arr[i]):
            temp = arr[i]
            arr[i] = arr[i-1]
            arr[i-1] = temp
    bubbleSort_Recursion(arr,size-1)

a=[23,45,6,2,13,76,48,11]
bubbleSort_Recursion(a,len(a))

The result is as follows: