def partition(arr, low, high):i = (low - 1)pivot = arr[high]for j in range(low, high):if arr[j] <= pivot:i = i + 1arr[i], arr[j] = arr[j], arr[i]arr[i + 1], arr[high] = arr[high], arr[i + 1]return (i + 1)def quickSort(arr, low, high):if low < high:pi = partition(arr, low, high)quickSort(arr, low, pi - 1)quickSort(arr, pi + 1, high)arr = [10, 7, 8, 9, 1, 5]print("Initial array is:", arr)n = len(arr)quickSort(arr, 0, n - 1)# patch-1# print("Sorted array is:", arr)# =======print("Sorted array is:")# patch-4# for i in range(0,n):# =======for i in range(0,len(arr)):# masterprint(arr[i],end=" ")#your code is best but now it is easy to understand# master
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。