三种排序算法及三种变量交换的宏实现[1]

1、快速排序

#include <stdio.h>

#include <string.h>

#include <stdlib.h>

#define n 100

#define swap(x,y)                    \

{                                               \

       int t;t=(x);(x)=(y);(y)=t;    \

}

int partition(int a[],int l,int r);

void quick_sort(int a[],int l,int r);