下面代码的时间复杂度为O(n*n)。( )
arr = [ 2, 3, 4, 10, 40 ] n = len(arr) for i in range(n): for j in range(0, n-i-1): if arr[j] > arr[j+1] : arr[j], arr[j+1] = arr[j+1], arr[j]