快速排序1

#include<stdio.h>

int arr[100];

void merge_s(int i, int j)

{

int temp = i;

if (i > j)

{

return;

}

int a;

int left = i;

int right = j;

while (left != right)

{

while (arr[right] >= arr[temp] && left < right)

{

right--;

}

while(arr[left] <= arr[temp] && left < right)

{

left++;

}

if (left < right)

{

a = arr[left];

arr[left] = arr[right];

arr[right] = a;

}

}

a = arr[i];

arr[i] = arr[left];

arr[left] = a;

merge_s(i, left - 1);

merge_s(left + 1, j);

return;

}

int main()

{

int n;

scanf_s("%d", &n);

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

{

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

}

merge_s(0, n - 1);

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

{

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

}

return 0;

}