按地址传递参数的冒泡排序

#include <stdio.h>

#define SIZE 10

void myswap(int *, int *);

int main(void){
    int a[SIZE] = { 99, 33, 2, 67, 45, 504, 34, 22, 14, 1 };

    /* before sort */
    printf("\nbefore sort: \n");
    for (int i = 0; i < SIZE; i++) {
        printf("%d ", a[i]);
    }
    /* Bubble Sort */
    for (int i = 0; i < SIZE; i++) {
        for (int j = 0; j < (SIZE - 1); j++) {
            if (a[j] > a[j + 1] ) {
                myswap(&a[j], &a[j + 1]);/* call the myswap fun */
            }
        }
    }
    /* after sort */
    printf("\nafter sort: \n");
    for (int i = 0; i < SIZE; i++) {
        printf("%d ", a[i]);
    }
    return 0;
}

/* myswap function */
void myswap(int *p1, int *p2){
    int tmp;
    tmp = *p1;
    *p1 = *p2;
    *p2 = tmp;
}