버블정렬

#include <stdio.h>
 
int main(void) {
    int num = 10;
    int* pnum = &num;
    int** ppnum = &pnum;
 
    printf(" addr(num) -> %p / pnum -> %p \n", &num, pnum);
    printf(" ppnum -> %p / addr(pnum) -> %p\n", ppnum, &pnum);
    printf(" *ppnum -> %p / pnum -> %p\n", *ppnum, pnum);
    printf(" **ppnum -> %d / num -> %d \n", (**ppnum), num);
    return 0;
}

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
 
typedef struct _bubble {
    int _size_;
    int* Array;
}bubble;
// Func prototype
void __init__(bubble** b);
void __dataInput__(bubble** b);
void __before__(bubble** b);
void __bubbleSort__(bubble** b);
// ______________main__________________
int main(void) {
    bubble* stu = NULL;
    __init__(&stu);
    __dataInput__(&stu);
    __before__(&stu);
    __bubbleSort__(&stu);
    return 0;
}
 
void __init__(bubble** b) {
    (*b) = (bubble*)malloc(sizeof(bubble));
    (**b)._size_ = 0;
    (**b).Array = NULL;
} // end of __init_i
void __dataInput__(bubble** b) {
    int i; // index
    printf(" 배열의 사이즈 입력 : ");
    scanf("%d", &((**b)._size_));
 
    (**b).Array = (int*)malloc(sizeof(int)* (**b)._size_);
    memset( (**b).Array ,0, sizeof(int)* (**b)._size_ );
 
    for (i = 0 ; i < (*b)->_size_ ; i++) {
        printf( " Array[%d] : ", i);
        scanf( "%d", ((*b)->Array + i));
    }
} // end of __dataInput__
void __before__(bubble** b) {
    int i;
    printf("=============== 정렬 전 =============== \n");
    for (i = 0 ; i < (**b)._size_ ; i++) {
        printf("[%d] ", *((*b)->Array + i) );
    } printf("\n");
    printf("====================================== \n");
}
void __bubbleSort__(bubble** b) {
    int i, j, k; // index
    int result;
    int temp = 0;
    int count = 0;
    for (i = 0 ; i < (**b)._size_ - 1; i++) {
        result = 0;
        for (j = 0 ; j <(**b)._size_ - 1; j++) {
            if ( *((*b)->Array + j) > *((*b)->Array + (j+1)) ) {
                temp = *((*b)->Array + j);
                *((*b)->Array + j) = *((*b)->Array + (j+1));
                *((*b)->Array + (j+1)) = temp;
                count++;
                result = 1;
            }
        }
        if (result == 1) {
            for (k = 0 ; k < (**b)._size_ ; k++) {
                printf("[%d] ", *((*b)->Array + k) );
            } printf("\n");
        } else { // result == 0
            
            break;
        }
    }
    printf("=============== 정렬 후 =============== \n");
    for (k = 0 ; k < (**b)._size_ ; k++) {
        printf("[%d] ", *((*b)->Array + k) );
    } printf("\n");
    printf("====================================== \n");
    printf("정렬 횟수 : %d \n", count);
}