1741: 排序-快速排序

#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 20   // 一个用作示例的小顺序表的最大长度
typedef int KeyType; //定义关键字类型为整型
typedef struct {
	int key;
} RedType;
typedef struct {
	//顺序表类型
	RedType r[MAXSIZE + 1]; //r[0]闲置或用作哨兵单元
	int length;             //顺序表长度
} Sqlist;

int Partition(Sqlist &L, int low, int high);
void QSort(Sqlist &L, int low, int high);

int main() {
	Sqlist L;
	int i, low, high;
	scanf("%d", &L.length);
	for (i = 1; i <= L.length; i++)
		scanf("%d", &L.r[i].key);
	low = 1;
	high = L.length;
	QSort(L, low, high);
	for (i = 1; i <= L.length; i++) {
		printf("%d\t", L.r[i].key);
	}
	printf("\n");
        return 0;
}
/*提交以下代码*/
int Partition(Sqlist &L, int low, int high) {
	
}
void QSort(Sqlist &L, int low, int high) {
	
}

9
49 38 65 97 13 27 48 55 4

4 13 27 38 48 49 55 65 97