快速排序
c++
#include <iostream>
using namespace std;
const int N = 100010;
int q[N];
void quick_sort(int q[], int l, int r)
{
if ( l >= r) return;
int i = l - 1, j = r + 1, x = q[l + r >> 1];
while (i < j)
{
do i ++ ; while (q[i] < x);
do j -- ; while (q[j] > x);
if (i < j) swap(q[i], q[j]);
}
quick_sort(q, l, j);
quick_sort(q, j + 1, r);
}
int main()
{
int n;
scanf("%d",&n);
for (int i =0; i < n; i ++ ) scanf("%d",&q[i]);
quick_sort(q,0,n-1);
for (int i = 0; i < n; i ++ ) printf("%d ",q[i]);
return 0;
}
python
def quick_sort(arr, l, r):
if l >= r:
return
i = l - 1
j = r + 1
x = arr[l + r >> 1]
while i < j:
while True:
i += 1
if arr[i] >= x:
break
while True:
j -= 1
if arr[j] <= x:
break
if i < j:
arr[i], arr[j] = arr[j], arr[i]
else:
break
quick_sort(arr, l, j)
quick_sort(arr, j+1, r)
if __name__ == '__main__':
n = input()
list_str = input()
arr = list(map(int, list_str.split()))
quick_sort(arr, 0, len(arr) - 1)
print(' '.join(map(str,arr)))