Bubble sort pointer

#include<stdio.h> 
#include<stdlib.h>
 
int main() {
	int a[] = { 3,2,1,7,6 };
	int n = sizeof(a) / sizeof(a[0]);
	
	int *p ,*q;
	int tmp;
	int *x = a + n - 1;
	
	for(p = a; p < a + n - 1; p++,x--) {
		for (q = a; q < x; ++q) {
			if (*q < *(q + 1)) {
				tmp = *q;
				*q = *(q + 1);
				*(q + 1) = tmp;
			}
		}
	}
	
	for (int i = 0; i < n; ++i) {
		printf("%d ", a[i]);
	}
	
	system("pause");
	return 0;
}

7 6 3 2 1