快速排序——————排序的训练

解题思路:

注意事项:

参考代码:

#include<stdio.h>

#define _CRT_SECURE_NO_DEPRECATE

#pragma warning(disable:4996)

#define N 20

void Quick_Sort(int arr[],int low,int high)

{

int i = low;

int j = high;

int temp ;

    temp = arr[low];

if (low >= high)

{

return;

}

while (arr[i] < temp)

{

i++;

}

while (arr[j] > temp)

{

j--;

}

int t = arr[i];

arr[i] = arr[j];

arr[j] = t;

Quick_Sort(arr,low+1,high);

Quick_Sort(arr,low,high-1);

}

int main()

{

int arr[N];

int i = 0;

for ( i =0; i < N; i++)

{

scanf("%d", &arr[i]);

if (arr[i] == 0)

{

i--;

break;

}

if (i == 9)

{

break;

}

}

Quick_Sort(arr, 0, i);

for (int t = 0; t <=i; t++)

{

printf("%d ", arr[t]);

}

return 0;

}