Python实现快速排序

# coding=utf-8 def partition(arr, low, high): i = (low - 1) pivot = arr[high] for j in range(low, high): if arr[j] <= pivot: i = i + 1 arr[i], arr[j] = arr[j], arr[i] arr[i + 1], arr[high] = arr[high], arr[i + 1] return i + 1 ...
2021-02-17 17:41 | 阅读 523 次 | 评论 1 条
文章分类
文章归档