def bubbleSort(lst): n = len(lst) for i in range(n): for j in range(n-i-1): if lst[j] > lst[j+1]: lst[j], lst[j+1] = lst[j+1], lst[j] lstData = [11, 2, 3, 7, 15] bubbleSort(lstData) print(lstData)
O(n)
O(n²)
O(n log n)
O(1)