def test(l, k):
return sorted(l[:k], reverse=True) + sorted(l[k:])
x = test([1, 6, 3, 4, 8, 9, 4, 2, 1], 4)
print(x)
对两侧分别冒泡排序(注意后半段下标需要+k)
def sort(arr, k):
for i in range(k):
for j in range(0, k-i-1):
if arr[j] < arr[j+1] :
arr[j], arr[j+1] = arr[j+1], arr[j]
n = len(arr)-k
for i in range(n):
for j in range(k, n-i-1+k):
if arr[j] > arr[j+1] :
arr[j], arr[j+1] = arr[j+1], arr[j]
arr = [4, 5, 2, 3, 10, 5, 8, 7]
sort(arr, 4)