排序【数组】（不改变相对位置）

 

#include<stdio.h>
#include<stdlib.h>
int main()
{
	int n;
	while (scanf("%d", &n) != EOF)
	{
		int* a = (int*)malloc(n);
		for (int i = 0; i < n; i++)
			scanf("%d", &a[i]);

		int i = 0, j = n - 1, x = 0;
		while (i < j)
		{
			while (i < j && a[j] >= x)j--;
			while (i < j && a[i] < x)i++;
			if (i < j) {
				int t = a[i];
				a[i] = a[j];
				a[j] = a[j - 1];
				a[j - 1] = t;
			}
		}

		for (int i = 0; i < n - 1; i++)
			printf("%d ", a[i]);
		printf("%d\n", a[n - 1]);
	}
	return 0;
}