untitled

Size: px

Start display at page:

Download "untitled"

ちとらこいたばし
5 years ago
Views:

1 C -1 -

2 -2 -

3 concept lecture keywords FILE, fopen, fclose, fscanf, fprintf, EOF, r w a, typedef gifts.dat Yt <gifts.dat> JZK-3 Jizake tsumeawase 45 BSP-15 Body soap set 3 BT-2 Bath towel set 25 TEA-2 Koutya tsumeawase gifts.dat., fscanf %s %d. 1-2, helloworld.txt Hello world When I woke up this morning, I found many people in my room. What s up : - 1

4 1-3 code( ), name( ), price( ) gift. gifts.dat., code: JZK-3 name: Jizake tsumeawase price: 45 typedef gift gifts.dat gift code: JZK-3 name: Jizake tsumeawase price: 45 code: BSP-15 name: Body soap set price: 3 ( ) 1-5 gifts.dat 1-4 gifts.dat 6 price price price: xxxx ( ) fscanf, fgets., 2

5 feof., toupper tolower.. 3

6 2 concept lecture keywords, ( ), ( ) 2-1 #include <stdio.h> main() { int a, *p; //( ) a p a = 1; printf("a: %d\n", a); printf("&a: %p\n\n", &a); p = &a; printf("p: %p\n", p); printf("*p: %d\n", *p); printf("&p: %p\n\n", &p); a = 2; printf("a: %d\n", a); printf("&a: %p\n\n", &a); } printf("p: %p\n", p); printf("*p: %d\n", *p); printf("&p: %p\n", &p); 4

7 2-2 #include <stdio.h> main() { char c, *p; char s[12] = "Ritsumeikan"; c = A ; p = &c; printf("c: %c\n", c); printf("&c: %p\n\n", &c); printf("p: %p\n", p); printf("*p: %c\n\n", *p); *p = B ; printf("c: %c\n", c); printf("&c: %p\n\n", &c); printf("p: %p\n", p); printf("*p: %c\n\n", *p); printf("s: %s\n", s); printf("s[]: %c\n", s[]); printf("s[1]: %c\n", s[1]); printf("s: %p\n", s); printf("&s[]: %p\n", &s[]); printf("*s: %c\n", *s); printf("*(s+1): %c\n\n", *(s+1)); } *(s+2) = T ; printf("s: %s\n", s); 5

8 2-3. #include <stdio.h> int main( void ) { char *p1, *p2; p2 = Winter ; p1 = p2; while ( *p1!= \ ) { ; // } } while ( ) { // ; putchar( *p1 ); // } putchar( \n ); return ; retniw 2-4 EOF, th Th th Th ++ We have seen other things matter. But, that is the thing that matters. ˆD We have seen o++er ++ings matter. But, ++at is ++e ++ing ++at matters. 69 th 6 ˆD EOF Ctrl D 6

9 concept,,.,,. lecture keywords malloc, free, size t,, 3-1 C char malloc : 26 : abcdefghijklmnopqrstuvwxyz ZYXWVUTSRQPONMLKJIHGFEDCBA 3-2 char *name[5] 2 1 printf() %x 16 7

10 ( ) 5 KusatsuTaro KinugasaHanako BeppuJiro ˆD x84981 KusatsuTaro x84982 KinugasaHanako x84983 BeppuJiro gifts.dat 1-4,. 4 gifts.dat 8

11 concept, lecture keywords strlen, strcpy, strcat, strcmp, string.h, 4-1 x, y #include <stdio.h> void swap(int x, int y); int main(){ int x,y; x = 2; y = 5; swap(x,y); printf("x=%d, y=%d\n",x,y); } void swap(int x, int y){ int temp = x; x = y; y = temp; } 9

12 4-2 x y, swap x,y 3 9 x 3 y 9 swap() x 9 y word pair typedef struct word_pair{ char longer_word[1]; char shorter_word[1]; char combined_word[21]; int longer_word_length; int shorter_word_length; } word_pair_t; // // // // //, word pair t create word pair(char *a, char *b); create word pair. create word pair a b longer word shorter word longer word shorter word a b longer word shorter word ( ) combined word longer word shorter word longer word length, shorter word length create word pair string.h. 1

13 * / 9 1 ERROR atoi() %8 ERROR 11

14 concept. lecture keywords push, pop #define 1 1: Push (data) : data push-down Pop: data pop-up ( ) 5-1 top void print stack ary(char* s, int top); char. 12

15 : [h,o,g,e] top 4 <---TOP=4 e g o h s[max] top push-down void push(char c, char* s, int* top); push-down, print stack ary MAX. ( ) top push pop-up char pop(char* s, int* top); print stack ary pop pop. print stack ary 5-4 push-down / pop-up pop-up pop-up push-down 13

16 print stack ary ,1 push-down 2 A Stack1 pop-up Stack2 push-down B Stack2 pop-up Stack1 push-down C Stack1 push-down push-down pop-up A B C 2: 14

17 concept. lecture keywords enqueue, dequeue 1 3: Enqueue (data). Dequeue. 6-1 top rear void print queue ary(char* q, int top, int rear) 15

18 : [h,o,g,e] top 3, rear 7 h<---top=3 o g e <---REAR= s[max] top, rear enqueue void enqueue(char c, char* q, int* top, int* rear) enqueue print queue ary MAX s[max] top, rear dequeue char dequeue(char* q, int* top, int* rear) print queue ary dequeue dequeue print queue ary 6-4 enqueue / dequeue dequeue dequeue 16

19 enqueue print queue ary ,1 enqueue 4 2 A Queue1 1 dequeue Queue2 enqueue B Queue2 1 dequeue Queue1 enqueue C Queue1 enqueue 2 enqueue dequeue 1 A B C 4: 17

20 concept lecture keywords malloc data struct data{ char key; struct data *next; }; 7-1 data top. malloc printf("%c\n",top->key); printf("%c\n",top->next->key); printf("%c\n",top->next->next->key); a b c 18

21 top key next a b c 5: key void print stack list(struct data *top) 5-1 : [h,o,g,e] e<---top g o h 7-3 queue. struct queue{ struct data *top, *rear; }; queue q 19

22 top rear q key next a b c 6: (rear ) printf("%c\n",q.top->key); printf("%c\n",q.top->next->key); printf("%c\n",q.rear->key); a b c key void print queue list(struct queue q) 6-1 : [h,o,g,e] h<---top o g e<---rear 2

23 concept. lecture keywords,, push pop push push print stack list push ( ) push. void push (struct data **top, char key); pop. pop print stack list pop. ( ) pop. char pop (struct data **top); enqueue enqueue print queue list enqueue ( ) enqueue. 21

24 void enqueue (struct queue *q, char key); 8-4 dequeue dequeue print queue list dequeue ( ) dequeue. char dequeue (struct queue *q); 8-5 enqueue / dequeue 1. enqueue dequeue dequeue enqueue print queue list 8-6 push-down / pop-up pop-up pop-up push-down print stack list 22

25 concept, lecture keywords numbers.dat numbers.dat numbers.dat numbers.dat numbers.dat 1 23

26 9-4 countries16.dat ( : 24

27 concept lecture keywords 1, insert, deletemin 1-1 numbers.dat a int check heap(int *a, int N) 1, N insert. insert check heap. void insert(int val, int a[], int N); 25

28 1-4 deletemin 1-3 insert. deletemin.. int deletemin(int a[], int N); 26

29 concept lecture keywords 11-1 numbers.dat numbers.dat numbers.dat numbers.dat numbers1k.dat ( : 1,) numbers1k.dat ( : 1,) numbers1k.dat ( : 1,) 1, 2. gettimeofday() gettimeofday() man gettimeofday ( : 27

30 concept lecture keywords struct node struct node { int key; struct node *parent, *left, *right; }; print tree() print tree.c, main print tree print tree.c, : prog.c func.c. gcc -c prog.c prog.o. gcc -c func.c func.o. gcc prog.o func.o -o prog prog p new node() print tree() new node() print tree() 28

31 struct node *new node(int key) : key: node NULL. ( ) : node void print tree(struct node *node) : key: : node 2 2 #include <stdio.h> #include <stdlib.h> struct node { int key; struct node *parent, *left, *right; }; struct node *new_node(int key) { struct node *p; /* */ } return p; // p struct node main() { struct node *root, *n[1]; n[] = new_node(4); /* */ n[5] = new_node(18); 29

32 /* */ root = n[5]; n[]->left = new_node(); n[]->right = n[1]; n[]->parent = n[2]; /* */ n[5]->left = n[2]; n[5]->right = n[7]; n[5]->parent = NULL; /* */ } print_tree(root); :

33 concept lecture keywords insert, member, insert() insert() int insert(int key, struct node *root) : key: root: : : 2 key 2 key 1 : :

34 ( ) : : member recursive() v root Step 1. v x Step 2. v key(v) = x x Step 3. key(v) x key(v) > x v left(v) key(v) > x v right(v). 32

35 Step 1 3 member recursive() struct node *member recursive(int key, struct node *node) : key: root: : key NULL delete() delete() int delete(int key, struct node *root) : key: root: : 2 key 2 key 1 33

36 : : : : -1 34

37 concept lecture keywords 14-1 x y (x mod y) y=5 p struct node *table[5] print hash(). struct node{ int key; struct node *next; } 14-2 x struct node *member(struct node **table, int key) insert() 35

38 delete() 14-5 member(), insert(), delete() 36

39 concept lecture keywords

( ) ( ) 30 ( ) 27 [1] p LIFO(last in first out, ) (push) (pup) 1

( ) ( ) 30 ( ) 27 [1] p LIFO(last in first out, ) (push) (pup) 1 () 2006 2 27 1 10 23 () 30 () 27 [1] p.97252 7 2 2.1 2.1.1 1 LIFO(last in first out, ) (push) (pup) 1 1: 2.1.2 1 List 4-1(p.100) stack[] stack top 1 2 (push) (pop) 1 2 void stack push(double val) val stack