TZC 1283: 简单排序 —— 快速排序

我们以TZC 1283为例简单说明一下排序（含十大经典排序算法）的python实现方法和C实现方法。快速排序原理请参见：https://www.runoob.com/w3cnote/quick-sort-2.html

原题链接：1283: 简单排序

---

python代码如下：

import math


# 快速排序
def quick_sort(arr, left=None, right=None):
    left = 0 if not isinstance(left, (int, float)) else left
    right = len(arr) - 1 if not isinstance(right, (int, float)) else right
    if left < right:
        partition_index = partition(arr, left, right)
        quick_sort(arr, left, partition_index - 1)
        quick_sort(arr, partition_index + 1, right)
    return arr


def partition(arr, left, right):
    pivot = left
    index = pivot + 1
    i = index
    while i <= right:
        if arr[i] < arr[pivot]:
            swap(arr, i, index)
            index += 1
        i += 1
    swap(arr, pivot, index - 1)
    return index - 1


def swap(arr, i, j):
    arr[i], arr[j] = arr[j], arr[i]


T = int(input())
for i in range(T):
    s = input().split()
    lt = [int(x) for x in s]
    lt1 = lt[::-1]
    lt1.pop()
    lt1 = lt1[::-1]
    n = len(lt1)

    quick_sort(lt1, 0, n - 1)

    for j in range(n):
        if j != n - 1:
            print(lt1[j], end=' ')
        else:
            print(lt1[j])

 C语言代码如下：

#include <stdio.h> 
#include <string.h> 
#define N 1010

int Paritition1(int A[], int low, int high)
{
   int pivot = A[low];
   while (low < high)
   {
     while(low < high && A[high] >= pivot)
	 {
       --high;
     }
     A[low] = A[high];
     while (low < high && A[low] <= pivot)
	 {
       ++low;
     }
     A[high] = A[low];
   }
   A[low] = pivot;
   return low;
 }

 void quick_sort(int A[], int low, int high) //快排母函数
 {
   if (low < high)
   {
     int pivot = Paritition1(A, low, high);
     quick_sort(A, low, pivot - 1);
     quick_sort(A, pivot + 1, high);
   }
 }
  
 int main()
{
	int m,n,i,j,t,a[N];
	scanf("%d",&m);
	while(m--)
	{
		scanf("%d",&n);
		memset(a,0,n);			//初始化数组
		for(i=0;i<=n-1;i++)		//输入
			scanf("%d",&a[i]);
		
		quick_sort(a,0,n-1);

		for(i=0;i<=n-1;i++)		//输出 
		{
			if(i!=n-1)
				printf("%d ",a[i]);
			else
				printf("%d\n",a[i]);
		}
	}
	return 0;
}