• 화요일 휴강, 급히 보강
  
• function, 선언 후 정의
  
• function pointer
  
• void qsort(void*, size_t, size_t, int (*)(int,int));
  
• structure type
  
  
• 실습 : 정수 동적 배열 자료구조 int_arr을 만들자
  

typedef struct
{
        size_t len;
        int* ptr;
} int_arr;

int_arr* init(size_t cap);

int ia_get(int_arr* ia_p, size_t idx, int val);
int ia_set(int_arr* ia_p, size_t idx);
int ia_insert(int_arr* ia_p, size_t idx, int val);
int ia_delete(int_arr* ia_p, size_t idx);
int ia_push(int_arr* ia_p);
int ia_pop(int_arr* ia_p);
int ia_sort(int_arr* ia_p, int order);//ascending(if true) or desending(if false)