def quick(arr): if len(arr) <= 1: return arr ____________________ left = [x for x in arr if x < p] middle = [x for x in arr if x == p] right = [x for x in arr if x > p] return quick(left) + middle + quick(right)
p = arr[len() // 2]
p = arr[len(arr)+1 // 2]
p = arr[len(arr)-1 // 2]
p = arr[len(arr) // 2]