指针数组实现冒泡排序

#include <stdio.h>
#include <stdlib.h>

int a[8] = { 1, 8, 2, 7, 3, 6, 4, 5 };

const int* p[8] = { a, a + 1, a + 2, a + 3, a + 4, a + 5, a + 6, a + 7 };

void main()
{
	for (int i = 0; i < 8 - 1; i++)
	{
		for (int j = 0; j < 8 - 1 - i; j++)
		{
			if (*p[j] < *p[j + 1])
			{
				const int *ptemp = p[j];
				p[j] = p[j + 1];
				p[j + 1] = ptemp;
			}
		}
	}

	for (int i = 0; i < 8; i++)
	{
		printf("%4d", *p[i]);
	}

	system("pause");
}

 

转载于:https://www.cnblogs.com/xiaochi/p/5114424.html