새싹교실/2018/C알/4월11일 - Revision history

165.194.17.83 at 06:34, 8 May 2018

2018-05-08T06:34:05Z

@@ Line 105: / Line 105: @@
   	return ia_p-&gt;ptr[ia_p-&gt;len];
+  }
-  int ia_sort(int_arr* ia_p, int order)
+  int ia_sort(int_arr* ia_p, int order){
 = 기타 / 후기 / 방명록 =
 -----------------------------------

165.194.17.83 at 06:27, 8 May 2018

2018-05-08T06:27:47Z

@@ Line 25: / Line 25: @@
 = 실습 =
 = 기타 / 후기 / 방명록 =
 -----------------------------------

165.194.17.180 at 08:40, 24 April 2018

2018-04-24T08:40:32Z

← Older revision		Revision as of 08:40, 24 April 2018
Line 29:		Line 29:
	[[새싹교실/2018/C알]]		[[새싹교실/2018/C알]]
	[[새싹교실/2018]]		[[새싹교실/2018]]
			* 동적할당 했으니 풀어주는 함수도 있어야 하지 않을까요? - 승진

165.194.17.62 at 09:35, 11 April 2018

2018-04-11T09:35:24Z

← Older revision		Revision as of 09:35, 11 April 2018
Line 20:		Line 20:
	int ia_insert(int_arr* ia_p, size_t idx, int val);		int ia_insert(int_arr* ia_p, size_t idx, int val);
	int ia_delete(int_arr* ia_p, size_t idx);		int ia_delete(int_arr* ia_p, size_t idx);
	int ia_push(int_arr* ia_p);		int ia_push(int_arr* ia_p, int val);
	int ia_pop(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)		int ia_sort(int_arr* ia_p, int order);//ascending(if true) or desending(if false)

165.194.17.62: {CREATE}

2018-04-11T09:32:59Z

{CREATE}

New page

__TOC__
= 진행 =
* 화요일 휴강, 급히 보강
* 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)
= 실습 =

= 기타 / 후기 / 방명록 =
-----------------------------------
[[새싹교실/2018/C알]]
[[새싹교실/2018]]