diff --git a/作業/C語言考前掙扎.pdf b/作業/C語言考前掙扎.pdf
new file mode 100644
index 0000000..efd4f4f
Binary files /dev/null and b/作業/C語言考前掙扎.pdf differ
diff --git a/作業/exam/exam.zip b/作業/exam/exam.zip
new file mode 100644
index 0000000..d4de816
Binary files /dev/null and b/作業/exam/exam.zip differ
diff --git a/作業/exam/exam/exam_1.cpp b/作業/exam/exam/exam_1.cpp
new file mode 100644
index 0000000..eee5fcb
--- /dev/null
+++ b/作業/exam/exam/exam_1.cpp
@@ -0,0 +1,264 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#include <string.h>
+#include <ctype.h>
+
+typedef struct node {
+    int coef;
+    int exp;
+    int root;
+    struct node* rlink;
+    struct node* llink;
+} node;
+node *head, *tail, *current, *prev, *temp ,*head_root , *current_root , *tail_root;
+
+void init_f() {
+    head = (node *)malloc(sizeof(node));
+    tail = (node *)malloc(sizeof(node));
+    head->rlink = tail;
+    tail->llink = head;
+    
+    head_root = (node *)malloc(sizeof(node));
+    tail_root = (node *)malloc(sizeof(node));
+
+    head_root->rlink = tail_root;
+    tail_root->llink = head_root;
+}
+
+void read_poly(char str[] ){
+	int argCount ;
+	while (1) {
+
+    	node* newNode = (node*)malloc(sizeof(node));
+    	
+        argCount = sscanf(str, "%dx^%d%s", &newNode->coef, &newNode->exp, str);
+        
+        if (argCount >= 2) {  // ���\Ū���Y�ƩM����
+        
+            newNode->llink = tail->llink;  
+		    newNode->rlink = tail;         
+		    tail->llink->rlink = newNode;  
+		    tail->llink = newNode;
+
+            if (argCount == 2) {
+				break ;
+			}
+				
+        } else {
+        	if(!isdigit(newNode->coef)){
+        		newNode->exp = 0;
+        		
+				newNode->llink = tail->llink;  
+			    newNode->rlink = tail;         
+			    tail->llink->rlink = newNode;  
+			    tail->llink = newNode;
+			    
+			    break ;
+			    
+			}else{
+//				printf("newNode->coef = %d\n",newNode->coef);
+//				printf("isdigit(newNode->coef) = %d",isdigit(newNode->coef));
+				
+				free(newNode);
+            	break ;
+			}
+            
+        }
+	}
+}
+
+void compact(char str[]){ /* ����str�������ťաA���ܱo��� */ 
+    int i, j;
+    
+    for (i = j = 0; str[i]; i++, j++) {
+    	for (; str[i]==' '; i++);
+    	str[j] = str[i];
+	}
+	str[j] = '\0';
+	printf("\n�����ťի᪺�r��G%s",str);
+}
+
+void clear_node(){
+	 // ����O����
+    current = head->rlink;
+    while (current != tail) {
+        temp = current;
+        current = current->rlink;
+        free(temp);
+    }
+    current_root = head_root->rlink;
+    while (current_root != tail_root) {
+        temp = current_root;
+        current_root = current_root->rlink;
+        free(temp);
+    }
+    free(head);
+    free(tail);
+    free(head_root);
+    free(tail_root);
+}
+
+
+void show( int n, int mode){
+	int i;
+	if(mode == 0){
+		printf("\n��{��p(x)= ");
+		current = head->rlink;
+		
+		while (current != tail) {
+			if(abs(current->coef)>1){
+				printf("%s%d", current->coef > 1? "":"\b",current->coef);
+			}else if(current->coef == -1){
+				printf("%s", current->exp == 0? "\b-1":"\b-");
+			}
+			switch(current->exp){
+				case 0: 
+					if(current->coef == 1 ) printf("1+");
+					else printf("+");
+					break;
+				case 1:
+					printf("x+");
+					break;
+				default:
+					printf("x^%d+",current->exp);
+			}
+	        current = current->rlink;
+	    }
+	    printf("\b ");		
+	    
+	}else { /* mode==1�A��ܩұo�� */ 
+	
+		current_root = head_root->rlink;
+		
+		while(current_root != tail_root){
+			printf("%d ",current_root->root);
+			current_root = current_root->rlink;
+		}
+		
+	}
+	
+}
+
+int findRoot() /* ��ڡA�ұo�Ѧs�Jq[]�A�^�Ǯڪ��Ӽ� */ 
+{
+	
+	current_root = head_root->rlink;
+	
+	int r, c = 0, i, j, k, sum;
+	int sign[2] = {1,-1};
+	
+	current = tail->llink;
+	r = abs(current->coef);				/* ���X�̧C�������Y�� */
+	
+	if (current->exp != 0) { /* �̧C���������� >= 1�A�h0���i��� */ 
+		if ((i = current->exp) > 0) {
+				node* newNode = (node*)malloc(sizeof(node));
+				
+				newNode->root = 0; /* �̧C���������Ƴ]��i */
+
+				newNode->llink = tail_root->llink;  
+			    newNode->rlink = tail_root;         
+			    tail_root->llink->rlink = newNode;  
+			    tail_root->llink = newNode;
+			    c = 1;
+		}	
+		current = head->rlink;
+		while(current!=tail){
+			current->exp -= i; /* �Ҧ����������ƴ�hi */ 
+			current = current->rlink;
+		}
+	}
+	
+	
+//	r = abs(p[2*p[0]]);				/* ���X�̧C�������Y�� */
+
+	for (i = 1; i <= r; i++) {		/* �Ҽ{��㰣r���]��i�A���`�N���t�� */ 
+		if (r%i != 0) continue;		/* ����㰣r��i�N���L�A�~��Ҽ{�U�@��i */ 
+		
+		for (j = 0; j < 2; j++) {	/* j��0�A�N���Ҽ{+i�����ҡFj��1�A�N���Ҽ{-i�����p */
+			for (sum = 0, current = head->rlink ; current!= tail ; current = current->rlink)	/* �p��C�@�������G��(�Y��*x^����)�ò֥[��sum���� */ 
+				sum += current->coef *(int)(pow(sign[j]*i,current->exp));
+			if (sum == 0) {
+				node* newNode = (node*)malloc(sizeof(node));
+				newNode->root = sign[j]*i; /* bingo! �o�{�X�G���󪺾�ƮڡA�N��g�Jq�}�C */ 
+
+				newNode->llink = tail_root->llink;  
+			    newNode->rlink = tail_root;         
+			    tail_root->llink->rlink = newNode;  
+			    tail_root->llink = newNode;
+			    c = 1;
+			}  
+		}
+	}
+	
+	return c;
+}
+
+void sort(){ 
+
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->exp < temp->exp ){
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+int main() {
+    char str[100];
+    int poly_num ,c , high;
+    init_f();
+
+    printf("\n*** �Ѧh��������Ʈ� ***\n\n��J�h���� ==> ");
+    
+    if (fgets(str, sizeof(str), stdin) == NULL) {
+        printf("��J���~�I\n");
+        return 1;
+    }
+	compact(str);
+    read_poly(str);
+    sort();
+    
+    current = head->rlink;
+	high= current->exp;
+	
+	show(c,0);
+	c = findRoot();
+	
+	if (c > 0) {
+		printf("\n\n�ѱo��Ʈڬ��G");
+		show(c,1);  
+	}
+	else
+		printf("\n\n��Ʈڤ��s�b\n");
+	clear_node();
+    return 0;
+}
+
+
+
diff --git a/作業/exam/exam/exam_2.cpp b/作業/exam/exam/exam_2.cpp
new file mode 100644
index 0000000..8974824
--- /dev/null
+++ b/作業/exam/exam/exam_2.cpp
@@ -0,0 +1,290 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <math.h>
+#include <ctype.h>
+#define MAX 100
+
+// === �����ܼƫŧi ===
+char input[MAX];
+char postfix[MAX];
+char postfix_1[MAX]; //��ܥ� 
+char stack[MAX];
+double numStack[MAX];
+int top = -1;
+int numTop = -1;
+
+// === �禡�ŧi ===
+int get_priority(char op);
+int is_operator(char c);
+double calculate(double a, double b, char op);
+void convert_to_postfix();
+double evaluate_postfix();
+double evaluate_infix(char *expr);
+double parse_number(char **expr);
+
+int get_priority(char c){
+	if(c=='+' || c=='-'){
+		return 1;
+	}else if(c=='*' || c=='/' || c=='%' ){
+		return 2;
+	}else if(c=='^' || c=='s' || c=='c' ){
+		return 3;
+	}else{
+		return 0;
+	} 
+}
+
+// === �ˬd�r���O�_���B��l ===
+int is_operator(char c) {
+    return (c == '+' || c == '-' || c == '*' || c == '/' || c == '^' || c == '%' ||c == 's' || c == 'c');
+}
+
+// === ����B�� ===
+double calculate(double a, double b, char op) {
+    switch(op) {
+        case '+': return a + b;
+        case '-': return a - b;
+        case '*': return a * b;
+        case '/': 
+            if(b != 0) return a / b;
+            printf("���~�G���Ƥ��ର�s�I\n");
+            exit(1);
+        case '^': return pow(a, b);
+        case '%': return (int)a % (int)b;
+        
+        case 's': return sin(b);
+        case 'c': return cos(b);
+        default: return 0;
+    }
+}
+
+//��ܥ� 
+void convert_to_postfix_forprint() {
+    int i = 0, j;
+    int postfix_index = 0;
+    top = -1;
+    char number_str[MAX];
+    int is_negative;
+    
+    while(input[i] != '\0') {
+        if(isdigit(input[i]) || input[i] == '.' || (input[i] == '-' && (i == 0 || input[i-1] == '(' || is_operator(input[i-1])))) {
+            // �B�z�Ʀr�]�]�A�t�ơ^
+            is_negative = 0;
+            int num_len = 0;
+            
+            // �ˬd�O�_���t��
+            if(input[i] == '-') {
+                is_negative = 1;
+                i++;
+            }
+            
+            // ��������Ʀr�r��
+            while(input[i] != '\0' && (isdigit(input[i]) || input[i] == '.')) {
+                number_str[num_len++] = input[i++];
+            }
+            number_str[num_len] = '\0';
+            i--;  // �^�h�@�Ӧ�m�A�]���~�h while �|�A�[�@
+			
+            // ��X�Ʀr
+            printf("%s ", number_str);
+            if(is_negative) {
+                printf("- ");
+            }
+
+            // �N�Ʀr�[�J��Ǫ��F��
+            for(j = 0; j < num_len; j++) {
+                postfix_1[postfix_index++] = number_str[j];
+            }
+            postfix_1[postfix_index++] = ' ';
+            if(is_negative) {
+                postfix_1[postfix_index++] = '-';
+                postfix_1[postfix_index++] = ' ';
+            }
+        }
+        else if(input[i] == '(') {
+            stack[++top] = input[i];
+        }
+        else if(input[i] == ')') {
+            while(top >= 0 && stack[top] != '(') {
+                printf("%c ", stack[top]);
+                postfix_1[postfix_index++] = stack[top];
+                postfix_1[postfix_index++] = ' ';
+                top--;
+            }
+            if(top >= 0) top--;
+        }
+        else if(is_operator(input[i])) {
+            // �p�G���O�B�z�t�ƪ��
+            if(input[i-1] != 'o'){
+            	if(!(input[i] == '-' && (i == 0 || input[i-1] == '(' || is_operator(input[i-1])))) {
+                while(top >= 0 && stack[top] != '(' && 
+                      (get_priority(stack[top]) > get_priority(input[i]) ||
+                       (get_priority(stack[top]) == get_priority(input[i]) && input[i] != '^'))) {
+                    printf("%c ", stack[top]);
+                    postfix_1[postfix_index++] = stack[top];
+                    postfix_1[postfix_index++] = ' ';
+                    top--;
+                	}
+                stack[++top] = input[i];
+            	}
+			}
+            
+        }
+        i++;
+    }
+    
+    while(top >= 0) {
+        printf("%c ", stack[top]);
+        postfix_1[postfix_index++] = stack[top];
+        postfix_1[postfix_index++] = ' ';
+        top--;
+    }
+    postfix_1[postfix_index] = '\0';
+    printf("\n");
+}
+
+// === �ഫ����Ǫ��F�� === 
+//�p��� 
+void convert_to_postfix() {
+    int i = 0 , j;
+    int postfix_index = 0;
+    top = -1;
+    
+    while(input[i] != '\0') {
+        if(isdigit(input[i]) || input[i] == '.' || (input[i] == '-' && (i == 0 || input[i-1] == '(' || is_operator(input[i-1])))) {  // �ˬd�O�_���Ʀr�B�p���I�άO�t���]�B�O���F�����}�l�A�κ��b���A���ιB��ū᭱�^ 
+            char *end;
+            double num = strtod(&input[i], &end); //strtod ��r�괫���B�I�� 
+            int len = end - &input[i];  //�p��Ʀr�r�ꪺ���� �Ʀr���ݪ��O�����}��������O�����m 
+//            printf("%.1f ", num);
+            for(j = 0; j < len; j++) {
+                postfix[postfix_index++] = input[i+j];
+            }
+            postfix[postfix_index++] = ' ';
+            i += len - 1;
+        }
+        else if(input[i] == '(') {
+            stack[++top] = input[i];
+        }
+        else if(input[i] == ')') {
+            while(top >= 0 && stack[top] != '(') {
+//                printf("%c ", stack[top]);
+                postfix[postfix_index++] = stack[top];
+                postfix[postfix_index++] = ' ';
+                top--;
+            }
+            if(top >= 0) top--;
+        }
+        else if(is_operator(input[i])) {
+        	
+        	if(input[i-1]!='o'){
+        		while(top >= 0 && stack[top] != '(' && (get_priority(stack[top]) > get_priority(input[i]) || (get_priority(stack[top]) == get_priority(input[i]) && input[i] != '^'))) {
+//                printf("%c ", stack[top]);
+                postfix[postfix_index++] = stack[top];
+                postfix[postfix_index++] = ' ';
+                top--;
+            	}
+            stack[++top] = input[i];
+			}
+        }
+        i++;
+    }
+    
+    while(top >= 0) {
+//        printf("%c ", stack[top]);
+        postfix[postfix_index++] = stack[top];
+        postfix[postfix_index++] = ' ';
+        top--;
+    }
+    postfix[postfix_index] = '\0';
+//    printf("\n");
+}
+
+// === �p���Ǫ��F�� ===
+double evaluate_postfix() {
+	int i;
+    numTop = -1;
+    char *token = strtok(postfix, " ");
+    
+//    printf("\n�p��L�{�G\n");
+    
+    while(token != NULL) {
+//        printf("�B�z�аO�G'%s'\n", token);
+        
+        if(isdigit(token[0]) || (token[0] == '-' && isdigit(token[1]))) {
+            double num = atof(token);
+            numStack[++numTop] = num;
+//            printf("���J�Ʀr�G%.2f\n", num);
+        }else if(token[0] == 's'|| token[0] == 'c' ){
+        	if(numTop < 1) {
+//                printf("�B��l '%c' �ʤ֨������B�⤸\n", token[0]);
+                exit(1);
+            }
+            double b = numStack[numTop--];
+            double result = calculate(0, b, token[0]);
+            numStack[++numTop] = result;
+//            printf("�p��G%c %.2f = %.4f\n", token[0], b, result);
+            
+		}else if(is_operator(token[0])) {
+            if(numTop < 1) {
+//                printf("�B��l '%c' �ʤ֨������B�⤸\n", token[0]);
+                exit(1);
+            }
+            double b = numStack[numTop--];
+            double a = numStack[numTop--];
+            double result = calculate(a, b, token[0]);
+            numStack[++numTop] = result;
+//            printf("�p��G%.2f %c %.2f = %.4f\n", a, token[0], b, result);
+        }
+        else {
+//            printf("���~�G�������аO '%s'\n", token);
+            exit(1);
+        }
+        
+//        printf("���e���|�G");
+        for(i = 0; i <= numTop; i++) {
+//            printf("%.2f ", numStack[i]);
+        }
+//        printf("\n\n");
+        
+        token = strtok(NULL, " ");
+    }
+    
+    if(numTop != 0) {
+//        printf("���~�G�p�⵲������|���Ѿl %d �Ӥ���\n", numTop + 1);
+        exit(1);
+    }
+    return numStack[numTop];
+}
+
+int main() {
+	
+    printf("�п�J���Ǫ��ܦ�(�䴩+-*/%^()�B��) => ");
+    
+    fgets(input, MAX, stdin);
+    input[strcspn(input, "\n")] = 0;
+    
+    printf("\n��������Ǫ��ܪk���G ");
+    convert_to_postfix_forprint(); //��ܥ� 
+//    printf("\n�p�⪺��Ǫ��ܪk���G ");
+    convert_to_postfix();
+    double postfix_result = evaluate_postfix();
+    printf("\n�B�⵲�G�G%.4f", postfix_result);
+    
+    printf("\t(���T�Ȭ��G");
+    if(strcmp(input,"10+20*(50-30)/2^4-6*8")==0){
+    	printf("%g",10+20*(50-30)/pow(2,4)-6*8);
+	}else if(strcmp(input,"10+20*(-50+30)/-2^4-6*8")==0){
+    	printf("%g",10+20*(-50+30)/pow(-2,4)-6*8);
+	}else if(strcmp(input,"10.5+20.8*(50.1-30.6)/2.5^4-6.6*8.2")==0){
+    	printf("%g",10.5+20.8*(50.1-30.6)/pow(2.5,4)-6.6*8.2);
+	}else if(strcmp(input,"10.5+20.8*(-50.1+30.6)/2.5^-4-6.6*8.2")==0){
+    	printf("%g",10.5+20.8*(-50.1+30.6)/pow(2.5,-4)-6.6*8.2);
+	}else if(strcmp(input,"10-30*(-40-20)%2^4+7.5*-6")==0){
+    	printf("%g",10-30*(-40-20)%(int)pow(2,4)+7.5*-6);
+	}else if(strcmp(input,"1+sin((-50.2+sin(3.8*20)*cos(-30-100%40))*2^-2.5)*cos(123.456)")==0){
+    	printf("%g",1+sin((-50.2+sin(3.8*20)*cos(-30-100%40))*(int)pow(2,-2.5))*cos(123.456));
+	}printf(")");
+    
+    return 0;
+}
diff --git a/作業/exam/exam_1.cpp b/作業/exam/exam_1.cpp
new file mode 100644
index 0000000..eee5fcb
--- /dev/null
+++ b/作業/exam/exam_1.cpp
@@ -0,0 +1,264 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#include <string.h>
+#include <ctype.h>
+
+typedef struct node {
+    int coef;
+    int exp;
+    int root;
+    struct node* rlink;
+    struct node* llink;
+} node;
+node *head, *tail, *current, *prev, *temp ,*head_root , *current_root , *tail_root;
+
+void init_f() {
+    head = (node *)malloc(sizeof(node));
+    tail = (node *)malloc(sizeof(node));
+    head->rlink = tail;
+    tail->llink = head;
+    
+    head_root = (node *)malloc(sizeof(node));
+    tail_root = (node *)malloc(sizeof(node));
+
+    head_root->rlink = tail_root;
+    tail_root->llink = head_root;
+}
+
+void read_poly(char str[] ){
+	int argCount ;
+	while (1) {
+
+    	node* newNode = (node*)malloc(sizeof(node));
+    	
+        argCount = sscanf(str, "%dx^%d%s", &newNode->coef, &newNode->exp, str);
+        
+        if (argCount >= 2) {  // ���\Ū���Y�ƩM����
+        
+            newNode->llink = tail->llink;  
+		    newNode->rlink = tail;         
+		    tail->llink->rlink = newNode;  
+		    tail->llink = newNode;
+
+            if (argCount == 2) {
+				break ;
+			}
+				
+        } else {
+        	if(!isdigit(newNode->coef)){
+        		newNode->exp = 0;
+        		
+				newNode->llink = tail->llink;  
+			    newNode->rlink = tail;         
+			    tail->llink->rlink = newNode;  
+			    tail->llink = newNode;
+			    
+			    break ;
+			    
+			}else{
+//				printf("newNode->coef = %d\n",newNode->coef);
+//				printf("isdigit(newNode->coef) = %d",isdigit(newNode->coef));
+				
+				free(newNode);
+            	break ;
+			}
+            
+        }
+	}
+}
+
+void compact(char str[]){ /* ����str�������ťաA���ܱo��� */ 
+    int i, j;
+    
+    for (i = j = 0; str[i]; i++, j++) {
+    	for (; str[i]==' '; i++);
+    	str[j] = str[i];
+	}
+	str[j] = '\0';
+	printf("\n�����ťի᪺�r��G%s",str);
+}
+
+void clear_node(){
+	 // ����O����
+    current = head->rlink;
+    while (current != tail) {
+        temp = current;
+        current = current->rlink;
+        free(temp);
+    }
+    current_root = head_root->rlink;
+    while (current_root != tail_root) {
+        temp = current_root;
+        current_root = current_root->rlink;
+        free(temp);
+    }
+    free(head);
+    free(tail);
+    free(head_root);
+    free(tail_root);
+}
+
+
+void show( int n, int mode){
+	int i;
+	if(mode == 0){
+		printf("\n��{��p(x)= ");
+		current = head->rlink;
+		
+		while (current != tail) {
+			if(abs(current->coef)>1){
+				printf("%s%d", current->coef > 1? "":"\b",current->coef);
+			}else if(current->coef == -1){
+				printf("%s", current->exp == 0? "\b-1":"\b-");
+			}
+			switch(current->exp){
+				case 0: 
+					if(current->coef == 1 ) printf("1+");
+					else printf("+");
+					break;
+				case 1:
+					printf("x+");
+					break;
+				default:
+					printf("x^%d+",current->exp);
+			}
+	        current = current->rlink;
+	    }
+	    printf("\b ");		
+	    
+	}else { /* mode==1�A��ܩұo�� */ 
+	
+		current_root = head_root->rlink;
+		
+		while(current_root != tail_root){
+			printf("%d ",current_root->root);
+			current_root = current_root->rlink;
+		}
+		
+	}
+	
+}
+
+int findRoot() /* ��ڡA�ұo�Ѧs�Jq[]�A�^�Ǯڪ��Ӽ� */ 
+{
+	
+	current_root = head_root->rlink;
+	
+	int r, c = 0, i, j, k, sum;
+	int sign[2] = {1,-1};
+	
+	current = tail->llink;
+	r = abs(current->coef);				/* ���X�̧C�������Y�� */
+	
+	if (current->exp != 0) { /* �̧C���������� >= 1�A�h0���i��� */ 
+		if ((i = current->exp) > 0) {
+				node* newNode = (node*)malloc(sizeof(node));
+				
+				newNode->root = 0; /* �̧C���������Ƴ]��i */
+
+				newNode->llink = tail_root->llink;  
+			    newNode->rlink = tail_root;         
+			    tail_root->llink->rlink = newNode;  
+			    tail_root->llink = newNode;
+			    c = 1;
+		}	
+		current = head->rlink;
+		while(current!=tail){
+			current->exp -= i; /* �Ҧ����������ƴ�hi */ 
+			current = current->rlink;
+		}
+	}
+	
+	
+//	r = abs(p[2*p[0]]);				/* ���X�̧C�������Y�� */
+
+	for (i = 1; i <= r; i++) {		/* �Ҽ{��㰣r���]��i�A���`�N���t�� */ 
+		if (r%i != 0) continue;		/* ����㰣r��i�N���L�A�~��Ҽ{�U�@��i */ 
+		
+		for (j = 0; j < 2; j++) {	/* j��0�A�N���Ҽ{+i�����ҡFj��1�A�N���Ҽ{-i�����p */
+			for (sum = 0, current = head->rlink ; current!= tail ; current = current->rlink)	/* �p��C�@�������G��(�Y��*x^����)�ò֥[��sum���� */ 
+				sum += current->coef *(int)(pow(sign[j]*i,current->exp));
+			if (sum == 0) {
+				node* newNode = (node*)malloc(sizeof(node));
+				newNode->root = sign[j]*i; /* bingo! �o�{�X�G���󪺾�ƮڡA�N��g�Jq�}�C */ 
+
+				newNode->llink = tail_root->llink;  
+			    newNode->rlink = tail_root;         
+			    tail_root->llink->rlink = newNode;  
+			    tail_root->llink = newNode;
+			    c = 1;
+			}  
+		}
+	}
+	
+	return c;
+}
+
+void sort(){ 
+
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->exp < temp->exp ){
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+int main() {
+    char str[100];
+    int poly_num ,c , high;
+    init_f();
+
+    printf("\n*** �Ѧh��������Ʈ� ***\n\n��J�h���� ==> ");
+    
+    if (fgets(str, sizeof(str), stdin) == NULL) {
+        printf("��J���~�I\n");
+        return 1;
+    }
+	compact(str);
+    read_poly(str);
+    sort();
+    
+    current = head->rlink;
+	high= current->exp;
+	
+	show(c,0);
+	c = findRoot();
+	
+	if (c > 0) {
+		printf("\n\n�ѱo��Ʈڬ��G");
+		show(c,1);  
+	}
+	else
+		printf("\n\n��Ʈڤ��s�b\n");
+	clear_node();
+    return 0;
+}
+
+
+
diff --git a/作業/exam/exam_1.exe b/作業/exam/exam_1.exe
new file mode 100644
index 0000000..82f69a6
Binary files /dev/null and b/作業/exam/exam_1.exe differ
diff --git a/作業/exam/exam_2.cpp b/作業/exam/exam_2.cpp
new file mode 100644
index 0000000..1ac49b0
--- /dev/null
+++ b/作業/exam/exam_2.cpp
@@ -0,0 +1,296 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <math.h>
+#include <ctype.h>
+#define MAX 100
+
+// === �����ܼƫŧi ===
+char input[MAX];
+char postfix[MAX];
+char postfix_1[MAX]; //��ܥ� 
+char stack[MAX];
+double numStack[MAX];
+int top = -1;
+int numTop = -1;
+
+// === �禡�ŧi ===
+int get_priority(char op);
+int is_operator(char c);
+double calculate(double a, double b, char op);
+void convert_to_postfix();
+double evaluate_postfix();
+double evaluate_infix(char *expr);
+double parse_number(char **expr);
+
+int get_priority(char c){
+	if(c=='+' || c=='-'){
+		return 1;
+	}else if(c=='*' || c=='/' || c=='%' ){
+		return 2;
+	}else if(c=='^' || c=='s' || c=='c' ){
+		return 3;
+	}else{
+		return 0;
+	} 
+}
+
+// === �ˬd�r���O�_���B��l ===
+int is_operator(char c) {
+    return (c == '+' || c == '-' || c == '*' || c == '/' || c == '^' || c == '%' ||c == 's' || c == 'c');
+}
+
+// === ����B�� ===
+double calculate(double a, double b, char op) {
+    switch(op) {
+        case '+': return a + b;
+        case '-': return a - b;
+        case '*': return a * b;
+        case '/': 
+            if(b != 0) return a / b;
+            printf("���~�G���Ƥ��ର�s�I\n");
+            exit(1);
+        case '^': return pow(a, b);
+        case '%': return (int)a % (int)b;
+        
+        case 's': return sin(b);
+        case 'c': return cos(b);
+        default: return 0;
+    }
+}
+
+//��ܥ� 
+void convert_to_postfix_forprint() {
+    int i = 0, j;
+    int postfix_index = 0;
+    top = -1;
+    char number_str[MAX];
+    int is_negative;
+    
+    while(input[i] != '\0') {
+        if(isdigit(input[i]) || input[i] == '.' || (input[i] == '-' && (i == 0 || input[i-1] == '(' || is_operator(input[i-1])))) {
+            // �B�z�Ʀr�]�]�A�t�ơ^
+            is_negative = 0;
+            int num_len = 0;
+            
+            // �ˬd�O�_���t��
+            if(input[i] == '-') {
+                is_negative = 1;
+                i++;
+            }
+            
+            // ��������Ʀr�r��
+            while(input[i] != '\0' && (isdigit(input[i]) || input[i] == '.')) {
+                number_str[num_len++] = input[i++];
+            }
+            number_str[num_len] = '\0';
+            i--;  // �^�h�@�Ӧ�m�A�]���~�h while �|�A�[�@
+			
+            // ��X�Ʀr
+            printf("%s ", number_str);
+            if(is_negative) {
+                printf("- ");
+            }
+
+            // �N�Ʀr�[�J��Ǫ��F��
+            for(j = 0; j < num_len; j++) {
+                postfix_1[postfix_index++] = number_str[j];
+            }
+            postfix_1[postfix_index++] = ' ';
+            if(is_negative) {
+                postfix_1[postfix_index++] = '-';
+                postfix_1[postfix_index++] = ' ';
+            }
+        }
+        else if(input[i] == '(') {
+            stack[++top] = input[i];
+        }
+        else if(input[i] == ')') {
+            while(top >= 0 && stack[top] != '(') {
+                printf("%c ", stack[top]);
+                postfix_1[postfix_index++] = stack[top];
+                postfix_1[postfix_index++] = ' ';
+                top--;
+            }
+            if(top >= 0) top--;
+        }
+        else if(is_operator(input[i])) {
+            // �p�G���O�B�z�t�ƪ��
+            if(input[i] == '+' && input[i-1] == '('){
+            	
+			}
+        	else if(input[i-1] != 'o'){
+            	if(!(input[i] == '-' && (i == 0 || input[i-1] == '(' || is_operator(input[i-1])))) {
+                while(top >= 0 && stack[top] != '(' && 
+                      (get_priority(stack[top]) > get_priority(input[i]) ||
+                       (get_priority(stack[top]) == get_priority(input[i]) && input[i] != '^'))) {
+                    printf("%c ", stack[top]);
+                    postfix_1[postfix_index++] = stack[top];
+                    postfix_1[postfix_index++] = ' ';
+                    top--;
+                	}
+                stack[++top] = input[i];
+            	}
+			}
+            
+        }
+        i++;
+    }
+    
+    while(top >= 0) {
+        printf("%c ", stack[top]);
+        postfix_1[postfix_index++] = stack[top];
+        postfix_1[postfix_index++] = ' ';
+        top--;
+    }
+    postfix_1[postfix_index] = '\0';
+    printf("\n");
+}
+
+// === �ഫ����Ǫ��F�� === 
+//�p��� 
+void convert_to_postfix() {
+    int i = 0 , j;
+    int postfix_index = 0;
+    top = -1;
+    
+    while(input[i] != '\0') {
+    	
+        if(isdigit(input[i]) || input[i] == '.' || (input[i] == '-' && (i == 0 || input[i-1] == '(' || is_operator(input[i-1])))) {  // �ˬd�O�_���Ʀr�B�p���I�άO�t���]�B�O���F�����}�l�A�κ��b���A���ιB��ū᭱�^ 
+            char *end;
+            double num = strtod(&input[i], &end); //strtod ��r�괫���B�I�� 
+            int len = end - &input[i];  //�p��Ʀr�r�ꪺ���� �Ʀr���ݪ��O�����}��������O�����m 
+            printf("%.1f ", num);
+            for(j = 0; j < len; j++) {
+                postfix[postfix_index++] = input[i+j];
+            }
+            postfix[postfix_index++] = ' ';
+            i += len - 1;
+        }else if(input[i] == '(') {
+            stack[++top] = input[i];
+        }
+		else if(input[i] == ')') {
+            while(top >= 0 && stack[top] != '(') {
+                printf("%c ", stack[top]);
+                postfix[postfix_index++] = stack[top];
+                postfix[postfix_index++] = ' ';
+                top--;
+            }if(top >= 0) top--;
+        }else if(is_operator(input[i])) {
+        	if(input[i] == '+' && input[i-1] == '('){
+        		
+			}else if(input[i-1]!='o' ){
+        		while(top >= 0 && stack[top] != '(' && (get_priority(stack[top]) > get_priority(input[i]) || (get_priority(stack[top]) == get_priority(input[i]) && input[i] != '^'))) {
+                printf("%c ", stack[top]);
+                postfix[postfix_index++] = stack[top];
+                postfix[postfix_index++] = ' ';
+                top--;
+            	}
+            stack[++top] = input[i];
+			}
+        }
+        i++;
+    }
+    
+    while(top >= 0) {
+        printf("%c ", stack[top]);
+        postfix[postfix_index++] = stack[top];
+        postfix[postfix_index++] = ' ';
+        top--;
+    }
+    postfix[postfix_index] = '\0';
+    printf("\n");
+}
+
+// === �p���Ǫ��F�� ===
+double evaluate_postfix() {
+	int i;
+    numTop = -1;
+    char *token = strtok(postfix, " ");
+    
+    printf("\n�p��L�{�G\n");
+    
+    while(token != NULL) {
+        printf("�B�z�аO�G'%s'\n", token);
+        
+        if(isdigit(token[0]) || (token[0] == '-' && isdigit(token[1]))) {
+            double num = atof(token);
+            numStack[++numTop] = num;
+            printf("���J�Ʀr�G%.2f\n", num);
+        }else if(token[0] == 's'|| token[0] == 'c' ){
+        	if(numTop < 1) {
+                printf("�B��l '%c' �ʤ֨������B�⤸\n", token[0]);
+                exit(1);
+            }
+            double b = numStack[numTop--];
+            double result = calculate(0, b, token[0]);
+            numStack[++numTop] = result;
+            printf("�p��G%c %.2f = %.2f\n", token[0], b, result);
+            
+		}else if(is_operator(token[0])) {
+            if(numTop < 1) {
+                printf("�B��l '%c' �ʤ֨������B�⤸\n", token[0]);
+                exit(1);
+            }
+            double b = numStack[numTop--];
+            double a = numStack[numTop--];
+            double result = calculate(a, b, token[0]);
+            numStack[++numTop] = result;
+            printf("�p��G%.2f %c %.2f = %.2f\n", a, token[0], b, result);
+        }
+        else {
+            printf("���~�G�������аO '%s'\n", token);
+            exit(1);
+        }
+        
+        printf("���e���|�G");
+        for(i = 0; i <= numTop; i++) {
+            printf("%.2f ", numStack[i]);
+        }
+        printf("\n\n");
+        
+        token = strtok(NULL, " ");
+    }
+    
+    if(numTop != 0) {
+        printf("���~�G�p�⵲������|���Ѿl %d �Ӥ���\n", numTop + 1);
+        exit(1);
+    }
+    return numStack[numTop];
+}
+
+int main() {
+	
+    printf("�п�J���Ǫ��ܦ�(�䴩+-*/%^()�B��) => ");
+    
+    fgets(input, MAX, stdin);
+    input[strcspn(input, "\n")] = 0;
+    
+    printf("\n��������Ǫ��ܪk���G ");
+    convert_to_postfix_forprint(); //��ܥ� 
+    printf("\n�p�⪺��Ǫ��ܪk���G ");
+    convert_to_postfix();
+    double postfix_result = evaluate_postfix();
+    printf("\n�B�⵲�G�G%.4f", postfix_result);
+    
+    printf("\t(���T�Ȭ��G");
+    if(strcmp(input,"10+20*(50-30)/2^4-6*8")==0){
+    	printf("%g",10+20*(50-30)/pow(2,4)-6*8);
+	}else if(strcmp(input,"10+20*(-50+30)/-2^4-6*8")==0){
+    	printf("%g",10+20*(-50+30)/pow(-2,4)-6*8);
+	}else if(strcmp(input,"10.5+20.8*(50.1-30.6)/2.5^4-6.6*8.2")==0){
+    	printf("%g",10.5+20.8*(50.1-30.6)/pow(2.5,4)-6.6*8.2);
+	}else if(strcmp(input,"10.5+20.8*(-50.1+30.6)/2.5^-4-6.6*8.2")==0){
+    	printf("%g",10.5+20.8*(-50.1+30.6)/pow(2.5,-4)-6.6*8.2);
+	}else if(strcmp(input,"10-30*(-40-20)%2^4+7.5*-6")==0){
+    	printf("%g",10-30*(-40-20)%(int)pow(2,4)+7.5*-6);
+	}else if(strcmp(input,"1+sin((-50.2+sin(3.8*20)*cos(-30-100%40))*2^-2.5)*cos(123.456)")==0){
+    	printf("%g",1+sin((-50.2+sin(3.8*20)*cos(-30-100%40))*pow(2,-2.5))*cos(123.456));
+	}else if(strcmp(input,"100*(sin(sin(sin(50.2*cos((30+100%40)*sin(60/5.5)))+20*(50/30.0)^3.5-6*8)))^2")==0){
+    	printf("%g",100*pow(sin(sin(sin(50.2*cos((30+100%40)*sin(60/5.5)))+20*pow(50/30.0,3.5)-6*8)),2));
+	}else if(strcmp(input,"100*(sin(sin(sin(+50.2*cos((30+100%40)*sin(60/5.5)))+20*(+50/30.0)^3.5-6*8)))^2")==0){
+    	printf("%g",100*pow(sin(sin(sin(50.2*cos((30+100%40)*sin(60/5.5)))+20*pow(50/30.0,3.5)-6*8)),2));
+	}printf(")");
+   
+    return 0;
+}
diff --git a/作業/exam/exam_2.exe b/作業/exam/exam_2.exe
new file mode 100644
index 0000000..cba0565
Binary files /dev/null and b/作業/exam/exam_2.exe differ
diff --git a/作業/exam/main.cpp b/作業/exam/main.cpp
new file mode 100644
index 0000000..8bfb763
--- /dev/null
+++ b/作業/exam/main.cpp
@@ -0,0 +1,266 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#include <string.h>
+#include <ctype.h>
+
+typedef struct node {
+    int coef;
+    int exp;
+    int root;
+    struct node* rlink;
+    struct node* llink;
+} node;
+node *head, *tail, *current, *prev, *temp ,*head_root , *current_root , *tail_root;
+
+void init_f() {
+    head = (node *)malloc(sizeof(node));
+    tail = (node *)malloc(sizeof(node));
+    head->rlink = tail;
+    tail->llink = head;
+    
+    head_root = (node *)malloc(sizeof(node));
+    tail_root = (node *)malloc(sizeof(node));
+
+    head_root->rlink = tail_root;
+    tail_root->llink = head_root;
+}
+
+void read_poly(char str[] ){
+	int argCount ;
+	while (1) {
+
+    	node* newNode = (node*)malloc(sizeof(node));
+    	
+        argCount = sscanf(str, "%dx^%d%s", &newNode->coef, &newNode->exp, str);
+        
+        if (argCount >= 2) {  // ���\Ū���Y�ƩM����
+        
+            newNode->llink = tail->llink;  
+		    newNode->rlink = tail;         
+		    tail->llink->rlink = newNode;  
+		    tail->llink = newNode;
+
+            if (argCount == 2) {
+				break ;
+			}
+				
+        } else {
+        	if(!isdigit(newNode->coef)){
+        		newNode->exp = 0;
+        		
+				newNode->llink = tail->llink;  
+			    newNode->rlink = tail;         
+			    tail->llink->rlink = newNode;  
+			    tail->llink = newNode;
+			    
+			    break ;
+			    
+			}else{
+//				printf("newNode->coef = %d\n",newNode->coef);
+//				printf("isdigit(newNode->coef) = %d",isdigit(newNode->coef));
+				
+				free(newNode);
+            	break ;
+			}
+            
+        }
+	}
+}
+
+void compact(char str[]){ /* ����str�������ťաA���ܱo��� */ 
+    int i, j;
+    
+    for (i = j = 0; str[i]; i++, j++) {
+    	for (; str[i]==' '; i++);
+    	str[j] = str[i];
+	}
+	str[j] = '\0';
+	printf("\n�����ťի᪺�r��G%s\n",str);
+}
+
+void clear_node(){
+	 // ����O����
+    current = head->rlink;
+    while (current != tail) {
+        temp = current;
+        current = current->rlink;
+        free(temp);
+    }
+    free(head);
+    free(tail);
+    free(head_root);
+    free(tail_root);
+}
+
+
+void show( int n, int mode){
+	int i;
+	if(mode == 0){
+		printf("\n��{��p(x)= ");
+		current = head->rlink;
+		
+		while (current != tail) {
+			if(abs(current->coef)>1){
+				printf("%s%d", current->coef > 1? "":"\b",current->coef);
+			}else if(current->coef == -1){
+				printf("%s", current->exp == 0? "\b-1":"\b-");
+			}
+			switch(current->exp){
+				case 0: 
+					if(current->coef == 1 ) printf("1+");
+					else printf("+");
+					break;
+				case 1:
+					printf("x+");
+					break;
+				default:
+					printf("x^%d+",current->exp);
+			}
+	        current = current->rlink;
+	    }
+	    printf("\b ");		
+	    
+	}else { /* mode==1�A��ܩұo�� */ 
+	
+		current_root = head_root->rlink;
+		
+		while(current_root != tail_root){
+			printf("%d ",current_root->root);
+			current_root = current_root->rlink;
+		}
+		
+	}
+	
+}
+
+int findRoot() /* ��ڡA�ұo�Ѧs�Jq[]�A�^�Ǯڪ��Ӽ� */ 
+{
+	
+	current_root = head_root->rlink;
+	
+	int r, c = 0, i, j, k, sum;
+	int sign[2] = {1,-1};
+	
+	current = tail->llink;
+	r = abs(current->coef);				/* ���X�̧C�������Y�� */
+	
+	if (current->exp != 0) { /* �̧C���������� >= 1�A�h0���i��� */ 
+		if ((i = current->exp) > 0) {
+				node* newNode = (node*)malloc(sizeof(node));
+				
+				newNode->root = 0; /* �̧C���������Ƴ]��i */
+
+				newNode->llink = tail_root->llink;  
+			    newNode->rlink = tail_root;         
+			    tail_root->llink->rlink = newNode;  
+			    tail_root->llink = newNode;
+			    c = 1;
+		}	
+		current = head->rlink;
+		while(current!=tail){
+			current->exp -= i; /* �Ҧ����������ƴ�hi */ 
+			current = current->rlink;
+		}
+	}
+	
+	
+//	r = abs(p[2*p[0]]);				/* ���X�̧C�������Y�� */
+
+	for (i = 1; i <= r; i++) {		/* �Ҽ{��㰣r���]��i�A���`�N���t�� */ 
+		if (r%i != 0) continue;		/* ����㰣r��i�N���L�A�~��Ҽ{�U�@��i */ 
+		
+		for (j = 0; j < 2; j++) {	/* j��0�A�N���Ҽ{+i�����ҡFj��1�A�N���Ҽ{-i�����p */
+			for (sum = 0, current = head->rlink ; current!= tail ; current = current->rlink)	/* �p��C�@�������G��(�Y��*x^����)�ò֥[��sum���� */ 
+				sum += current->coef *(int)(pow(sign[j]*i,current->exp));
+			if (sum == 0) {
+				node* newNode = (node*)malloc(sizeof(node));
+				newNode->root = sign[j]*i; /* bingo! �o�{�X�G���󪺾�ƮڡA�N��g�Jq�}�C */ 
+
+				newNode->llink = tail_root->llink;  
+			    newNode->rlink = tail_root;         
+			    tail_root->llink->rlink = newNode;  
+			    tail_root->llink = newNode;
+			    c = 1;
+			}  
+		}
+	}
+	
+	return c;
+}
+
+void sort(){ 
+
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->exp < temp->exp ){
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+int main() {
+    char str[100];
+    int poly_num ,c , high;
+    init_f();
+
+    printf("\n*** �Ѧh��������Ʈ� ***\n\n��J�h���� ==> ");
+    
+    if (fgets(str, sizeof(str), stdin) == NULL) {
+        printf("��J���~�I\n");
+        return 1;
+    }
+	
+	compact(str);
+    read_poly(str);
+    
+    sort();
+    
+    current = head->rlink;
+	high= current->exp;
+    
+	show(c,0);
+	
+	c = findRoot();
+	
+	if (c > 0) {
+		printf("\n\n�ѱo��Ʈڬ��G");
+		show(c,1);  
+	}
+	else
+		printf("\n\n��Ʈڤ��s�b\n");
+		
+    
+    
+	clear_node();
+   
+
+    return 0;
+}
+
+
+
diff --git a/作業/exam/main.exe b/作業/exam/main.exe
new file mode 100644
index 0000000..604530a
Binary files /dev/null and b/作業/exam/main.exe differ
diff --git a/作業/test/DS4_test.cpp b/作業/test/DS4_test.cpp
new file mode 100644
index 0000000..b8e1625
--- /dev/null
+++ b/作業/test/DS4_test.cpp
@@ -0,0 +1,375 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#include <conio.h> 	
+
+#define MAX_NAME_LENGTH 24
+
+//�ŧi�禡�쫬 
+void init_f();
+void readStudentsFromFile(char* filename);
+void insertStudent(char* name, int english, int math);
+void printStudentList();
+void sort(int mode , int target);
+void modify_list();
+void add_data(char* name, int english, int math);
+void remove_data(char* name);
+void choose_subject();
+
+// �w�q�ǥ͸`�I���c
+typedef struct Student {
+    char name[MAX_NAME_LENGTH];
+    int english;
+    int math;
+    struct Student* llink;
+    struct Student* rlink;
+} Student;
+
+Student *head, *tail, *current, *prev, *temp ,**arr;
+FILE* file; 
+int list_length ;
+
+void init_f() {
+    head = (Student *) malloc(sizeof(Student));
+    tail = (Student *) malloc(sizeof(Student));
+    
+//    head->llink = head;    // ���쵲���V�ۤv
+//    head->rlink = head;    // �k�쵲���V�ۤv
+//    tail = head;
+    
+//	head->llink = tail;
+	head->rlink = tail;
+//	tail->rlink = head;
+	tail->llink = head;
+}
+
+// �b�������J�s�ǥ͸`�I
+void insertStudent(char* name, int english, int math) {
+
+    Student* newNode = (Student*)malloc(sizeof(Student));
+	
+	strcpy(newNode->name, name);
+    newNode->english = english;
+    newNode->math = math;
+
+//  ���J����  
+    newNode->llink = tail->llink;  
+    newNode->rlink = tail;         
+    tail->llink->rlink = newNode;  
+    tail->llink = newNode;
+}
+
+//�W�[��� 
+void add_data(char* name, int english, int math){
+	Student* newNode = (Student*)malloc(sizeof(Student));
+	
+	strcpy(newNode->name, name);
+    newNode->english = english;
+    newNode->math = math;
+    
+    newNode->llink = tail->llink;  
+    newNode->rlink = tail;         
+    tail->llink->rlink = newNode;  
+    tail->llink = newNode;
+    printf("%s �w�W�[\n", name);
+}
+
+//��ָ�� 
+void remove_data(char* name){
+
+	prev = head;
+    current = head->rlink;
+    
+	while(current!=tail &&strcmp(name,current->name)!=0){
+		prev=current;
+		current=current->rlink;
+	}
+	if(current != tail){
+		
+		current->rlink->llink = prev;
+		prev->rlink = current->rlink;
+		printf("%s �w�R��\n", name);
+		free(current);
+	}else  /* �䤣���ƫh��ܿ��~ */
+        printf(" %s ���b��C��\n", name);
+	
+}
+
+// �q���Ū���ǥ͸��
+void readStudentsFromFile(char* filename) {
+    file = fopen(filename, "r");
+    if (file == NULL) {
+        printf("�L�k�}���ɮ� %s\n", filename);
+        exit(0);
+    }
+
+    char line[100];
+    int lineCount = 0;
+
+    // ���L�e�|��
+    while (lineCount < 4 && fgets(line, sizeof(line), file)) {
+        lineCount++;
+    }
+
+    // Ū���ǥ͸��
+    char name[MAX_NAME_LENGTH];
+    int english, math;
+	// %[ ]���ܭnŪ�J�@�Ӧr�Ŷ��X  
+	// %23[^\t]���uŪ���̦h23�Ӧr�šA����J��\t����v ^���D ���O\t�NŪ  
+	while(fgets(line, sizeof(line), file)!=NULL){
+		if(isalpha(line[0])){
+			sscanf(line, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+			insertStudent(name, english, math);
+		}else if(line[0]=='*'){
+			break;
+		}
+	}
+//	��flocse�����ե� ���`�ϥ����bmodify_list������ 
+//	fclose(file);
+}
+
+// ����***�᪺�W�[�δ�ָ�� 
+void modify_list(){
+	char name[MAX_NAME_LENGTH];
+    int english, math;
+	char line[100];
+	
+	while(fgets(line, sizeof(line), file)!=NULL){
+		if(line[0]=='+'){
+			sscanf(line, "%*[^ ] %[^\t]\t%d\t%d\n", name, &english, &math);
+			printf("\n===============================\n");
+	    	printf("�W�[�@�����\n\n");
+	    	add_data(name, english, math);
+	    	printStudentList();
+		}else if(line[0]=='-'){
+			sscanf(line, "%*[^ ] %[^\t]\t%d\t%d\n", name, &english, &math);
+			printf("\n===============================\n");
+	    	printf("�R���@�����\n\n");
+	    	remove_data(name);
+	    	printStudentList();
+	    }
+	}
+	fclose(file);
+}
+
+// �C�L�ǥͦC��
+void printStudentList() {
+	
+	current = head->rlink;
+	
+	printf("\n�q�Y�}�l\n");
+    printf("\n�m�W\t\t�^��\t�ƾ�\n");
+	printf("--------------------------------\n");
+	
+    while (current != tail) {
+        printf("%-15s\t%d\t%d\n", current->name, current->english, current->math);
+        current = current->rlink;
+    }
+    
+    current = tail->llink;
+    
+    printf("\n�q���}�l\n");
+    printf("\n�m�W\t\t�^��\t�ƾ�\n");
+    printf("--------------------------------\n");
+    while (current != head) {
+        printf("%-15s\t%d\t%d\n", current->name, current->english, current->math);
+        current = current->llink;
+    }
+}
+
+//�̷�mode�i��Ƨ� 
+void sort(int mode , int target){ 
+	list_length =  0; 
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+    current = head->rlink;
+    while(current!=tail){
+    	list_length++;
+    	current = current->rlink;
+	}
+    
+	Student **arr = (Student**)malloc(list_length*(sizeof(Student*)));
+	current = head->rlink;
+    for(int i = 0; i < list_length; i++) {
+        arr[i] = current;
+        current = current->rlink;
+    }
+    
+	for(int i = 0; i < list_length-1; i++) {
+        for(int j = 0; j < list_length-1-i; j++) {
+        	if(mode==0) {
+        		if(strcmp(arr[j]->name, arr[j+1]->name) > 0){
+        			Student *temp = arr[j];
+	                arr[j] = arr[j+1];
+	                arr[j+1] = temp;
+				}
+			}else if(mode==1){
+				if(arr[j]->english < arr[j+1]->english ){
+					Student *temp = arr[j+1];
+	                arr[j+1] = arr[j];
+	                arr[j] = temp;
+				}
+			} else if(mode==2){
+				if(arr[j]->math < arr[j+1]->math ){
+					Student *temp = arr[j+1];
+	                arr[j+1] = arr[j];
+	                arr[j] = temp;
+				}
+			} 
+        }
+    }
+    
+    if(target != -1){
+    	if(target != 0 && target<=list_length){
+			printf("�ƦW��%d���ǥͬ�\n\n"
+			"�m�W\t\t�^��\t�ƾ�\n%-15s\t%d\t%d", target, arr[target-1]->name, arr[target-1]->english, arr[target-1]->math);
+			printf("\n*****************************\n");
+		}else if(target == 0 && target >= list_length){
+			printf("\n*****************************\n");
+			printf("��Ƥ��s�b"); 
+			printf("\n*****************************\n");
+		}
+	}
+	
+
+	// ��ܱƧǫ᪺���G  
+    printf("\n�ƦW\t�m�W\t\t�^��\t�ƾ�\n");
+    printf("---------------------------------------------\n");
+    for(int i = 0; i < list_length; i++) {
+        printf("%d\t%-15s\t%d\t%d\n", i+1, arr[i]->name, arr[i]->english, arr[i]->math);
+    }
+    printf("---------------------------------------------\n");
+
+} 
+
+//��ܬ�ؤαƦW 
+void choose_subject(){
+	int subject ,number , i=1;
+	
+	printf("\n��J��ܪ����\n"
+	"1 �ƾ� 2 �^�� ==> ");
+	subject = getche();
+	switch(subject){
+			case '1':
+				printf("\n��J�ƦW(��J�����Ы�Enter) ==> ");
+				scanf("%d",&number);
+				printf("\n�ƾ�");
+				sort(1,number);
+				break;
+			case '2':
+				printf("\n��J�ƦW(��J�����Ы�Enter) ==> ");
+				scanf("%d",&number);
+				printf("\n�^��");
+				sort(2,number);	
+				break;
+			default :
+				printf("��J���~");
+				break;
+		}	
+}
+
+//����Ҧ��`�I 
+void freeAllNodes() {
+    current = head->rlink;
+    while (current != tail) {
+        temp = current;
+        current = current->rlink;
+        free(temp);
+    }
+    free(head);  // ���� head �`�I
+    free(tail);	 // ���� tail �`�I
+    free(arr);
+}
+
+int main() {
+	char mode ,sort_mode , name[15];
+	int english , math;
+    init_f();
+    readStudentsFromFile("YunTechStudents.txt");
+    
+    printStudentList();
+    modify_list();
+	
+	while(1){
+		printf("\n******* ��ܶi��ƧǩάO�ƦW��n�W���ǥ� *******\n"
+			   "*--------------------------------------*\n"
+			   "* 1 �i��Ƨ� 2 ��ܱƦW��n�W���ǥ� 3 ���� *\n"
+			   "* 4 ��ܭ�l��C 5 �M���e�� 6 �W�[�@����� *\n"
+			   "* 7 �R���@����� *\n"
+			   "\n�п�ܥ\\�� ==> "); //������ �\\�� �b�������|�ܶýX 
+		mode = getche();
+		switch(mode){
+			case '1':
+				printf("\n\n��ܱƧǤ覡\n"
+			   	"*--------------------------------------*\n"
+			   	"1 �W�r   2 �^�妨�Z   3 �ƾǦ��Z  \n"
+			   	"\n�п�ܱƧǤ覡 ==> "); 
+				sort_mode = getche();
+				switch(sort_mode){
+					case '1':
+						printf("\n\n�H�W�r�i��Ƨ�\n");
+						sort(0 ,-1);
+						break;
+					case '2':
+						printf("\n\n�H�^�妨�Z�i��Ƨ�\n");
+						sort(1 ,-1);	
+						break;
+					case '3':
+						printf("\n\n�H�ƾǦ��Z�i��Ƨ�\n");
+						sort(2 ,-1);
+						break;
+					default:
+						printf("\n��J���~\n");
+						break;
+					} 
+					break;
+			case '2':
+				choose_subject();
+				break;
+			case '3':
+				printf("\n\n���¨ϥΡABye~\n");
+				freeAllNodes();
+				return 0;
+			case '4':
+				printStudentList();
+				break;
+			case '5':
+				system("cls");
+				break;
+			case '6':
+				printf("\n��J�W�r ==> ");
+//				scanf("%[^\n]",name);
+				
+			    while(getchar() != '\n');  // �M���w��
+			    fgets(name, sizeof(name), stdin);
+			    name[strcspn(name, "\n")] = '\0';  // ���������
+			    
+				printf("\n��J�^�妨�Z ==> ");
+				scanf("%d",&english);
+				printf("\n��J�ƾǦ��Z ==> ");
+				scanf("%d",&math);
+				add_data(name,english,math);
+				
+				printStudentList();
+				break;
+			case '7':
+				printf("\n���R����J�W�r ==> ");
+//				scanf("%[^\n]",name);
+				
+			    while(getchar() != '\n');  // �M���w��
+			    fgets(name, sizeof(name), stdin);
+			    name[strcspn(name, "\n")] = '\0';  // ���������
+				remove_data(name);
+				
+				printStudentList();
+				break;
+			default:
+				printf("\n��J���~\n");
+				break;
+		} 
+	}
+}
diff --git a/作業/test/DS4_test.exe b/作業/test/DS4_test.exe
new file mode 100644
index 0000000..b380247
Binary files /dev/null and b/作業/test/DS4_test.exe differ
diff --git a/作業/test/YunTechStudents.txt b/作業/test/YunTechStudents.txt
new file mode 100644
index 0000000..665b05c
--- /dev/null
+++ b/作業/test/YunTechStudents.txt
@@ -0,0 +1,18 @@
+YunTech EE Department (2024)
+======================================
+Name		English	Math		
+---------------+-------+--------------
+Steve Jobs	50	60
+Tom Cruise	30	40
+Marie Jane	70	80
+Barrack Obama	46	77
+John Tyler	98	96
+U. S. Grant	97	88
+Robert Redford	22	33
+Bruce Lee	90	90
+**************************************
++ Oliver Hardy	90	80
++ Slim Pickens	88	82
+- Marie Jane	0	0
++ James Bond	88	82
+- Barrack Obama	0	0
\ No newline at end of file
diff --git a/作業/test/YunTechStudents2.txt b/作業/test/YunTechStudents2.txt
new file mode 100644
index 0000000..ceade09
--- /dev/null
+++ b/作業/test/YunTechStudents2.txt
@@ -0,0 +1,20 @@
+YunTech EE Department (2024)
+======================================
+Name		English	Math		
+---------------+-------+--------------
+Steve Jobs	50	60
+Tom Cruise	30	40
+Marie Jane	70	80
+Barrack Obama	46	77
+John Tyler	98	96
+U. S. Grant	97	88
+Robert Redford	22	33
+Bruce Lee	90	90
+**************************************
+- Steve Jobs	0	0
++ Oliver Hardy	90	80
++ Slim Pickens	88	82
+- Marie Jane	0	0
++ James Bond	88	82
+- Barrack Obama	0	0
+- James Bond	0	0
\ No newline at end of file
diff --git a/作業/test/double_pointer.cpp b/作業/test/double_pointer.cpp
new file mode 100644
index 0000000..08a34a2
--- /dev/null
+++ b/作業/test/double_pointer.cpp
@@ -0,0 +1,65 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <ctype.h>
+
+void convert(int n, int b, char **result, int *size) {
+    // �p��ݭn�����
+    int temp = n;
+    *size = 0;
+    while (temp > 0) {
+        temp /= b;
+        (*size)++;
+    }
+    
+    // �t�m�O����
+    *result = (char*)malloc((*size + 1) * sizeof(char));
+    if (*result == NULL) {
+        printf("�O����t�m���ѡI\n");
+        return;
+    }
+    
+    // �i���ഫ
+    int i = *size - 1;
+    while (n > 0) {
+        int remainder = n % b;
+        if (remainder < 10) {
+            (*result)[i] = remainder + '0';
+        } else {
+            (*result)[i] = (remainder - 10) + 'A';
+        }
+        n /= b;
+        i--;
+    }
+    (*result)[*size] = '\0';  // �K�[�r�굲��
+}
+
+int main() {
+    int n, b;
+    char *result;  // �ΨӦs���ഫ���G������
+    int size;      // ���G������
+    
+    while(1) {
+        printf("\n��J���ഫ���Q�i�쥿��� ==> ");
+        scanf("%d", &n);
+        
+        if(n == -1) break;
+        
+        printf("\n��J�ഫ���� ==> ");
+        scanf("%d", &b);
+        
+        convert(n, b, &result, &size);  // �ǤJ���Ъ���}
+        
+        printf("(%d)_10 = (", n);
+        for(int i = 0; i < size; i++) {
+            printf("%c", result[i]);
+        }
+        printf(")_%d\n", b);
+        
+        free(result);  // ����t�m���O����
+    }
+    
+    printf("�{���N����...�����N���~��\n");
+    system("pause");
+    
+    return 0;
+}
diff --git a/作業/test/double_pointer.exe b/作業/test/double_pointer.exe
new file mode 100644
index 0000000..f6d4c86
Binary files /dev/null and b/作業/test/double_pointer.exe differ
diff --git a/作業/test/ds2_test.cpp b/作業/test/ds2_test.cpp
new file mode 100644
index 0000000..c2aac9c
--- /dev/null
+++ b/作業/test/ds2_test.cpp
@@ -0,0 +1,196 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#include <string.h>
+#include <ctype.h>
+
+typedef struct node {
+    int coef;
+    int exp;
+    struct node* rlink;
+    struct node* llink;
+} node;
+node *head, *tail, *current, *prev, *temp;
+
+void init_f() {
+    head = (node *)malloc(sizeof(node));
+    tail = (node *)malloc(sizeof(node));
+    head->rlink = tail;
+    tail->llink = head;
+}
+
+void read_poly(char str[] ){
+	int argCount ;
+	while (1) {
+
+    	node* newNode = (node*)malloc(sizeof(node));
+    	
+        argCount = sscanf(str, "%dx^%d%s", &newNode->coef, &newNode->exp, str);
+        
+        if (argCount >= 2) {  // ���\Ū���Y�ƩM����
+        
+            newNode->llink = tail->llink;  
+		    newNode->rlink = tail;         
+		    tail->llink->rlink = newNode;  
+		    tail->llink = newNode;
+
+            if (argCount == 2) {
+				break ;
+			}
+				
+        } else {
+        	if(!isdigit(newNode->coef)){
+        		newNode->exp = 0;
+        		
+				newNode->llink = tail->llink;  
+			    newNode->rlink = tail;         
+			    tail->llink->rlink = newNode;  
+			    tail->llink = newNode;
+			    
+			    break ;
+			    
+			}else{
+//				printf("newNode->coef = %d\n",newNode->coef);
+//				printf("isdigit(newNode->coef) = %d",isdigit(newNode->coef));
+				
+				free(newNode);
+            	break ;
+			}
+            
+        }
+	}
+}
+
+void clear_node(){
+	 // ����O����
+    current = head->rlink;
+    while (current != tail) {
+        temp = current;
+        current = current->rlink;
+        free(temp);
+    }
+    free(head);
+    free(tail);
+}
+
+
+void show(int p[], int n, int mode){
+	int i;
+	if(mode == 0){
+		printf("\n��{��p(x)= ");
+		current = head->rlink;
+		while (current != tail) {
+			if(abs(current->coef)>1){
+				printf("%s%d", current->coef > 1? "":"\b",current->coef);
+			}else if(current->coef == -1){
+				printf("%s", current->exp == 0? "\b-1":"\b-");
+			}
+			switch(current->exp){
+				case 0: 
+					if(current->coef == 1 ) printf("1+");
+					else printf("+");
+					break;
+				case 1:
+					printf("x+");
+					break;
+				default:
+					printf("x^%d+",current->exp);
+			}
+	        current = current->rlink;
+	    }
+	    printf("\b ");		
+	    
+	}else { /* mode==1�A��ܩұo�� */ 
+		for (i = 0; i < n; i++) printf("%d�B",p[i]);
+		if (n > 0) printf("\b\b  ");
+	}
+	
+}
+
+int findRoot(int q[]) /* ��ڡA�ұo�Ѧs�Jq[]�A�^�Ǯڪ��Ӽ� */ 
+{
+	int r, c = 0, i, j, k, sum;
+	int sign[2] = {1,-1};
+	
+	current = tail->llink;
+	r = abs(current->coef);				/* ���X�̧C�������Y�� */
+	
+	if (current->exp != 0) { /* �̧C���������� >= 1�A�h0���i��� */ 
+		if ((i = current->exp) > 0) q[c++] = 0;	/* �̧C���������Ƴ]��i */
+		current = head->rlink;
+		while(current!=tail){
+			current->exp -= i; /* �Ҧ����������ƴ�hi */ 
+			current = current->rlink;
+		}
+	}
+	
+	
+//	r = abs(p[2*p[0]]);				/* ���X�̧C�������Y�� */
+
+	for (i = 1; i <= r; i++) {		/* �Ҽ{��㰣r���]��i�A���`�N���t�� */ 
+		if (r%i != 0) continue;		/* ����㰣r��i�N���L�A�~��Ҽ{�U�@��i */ 
+		
+		for (j = 0; j < 2; j++) {	/* j��0�A�N���Ҽ{+i�����ҡFj��1�A�N���Ҽ{-i�����p */
+			for (sum = 0, current = head->rlink ; current!= tail ; current = current->rlink)	/* �p��C�@�������G��(�Y��*x^����)�ò֥[��sum���� */ 
+				sum += current->coef *(int)(pow(sign[j]*i,current->exp));
+			if (sum == 0) q[c++] = sign[j]*i;  /* bingo! �o�{�X�G���󪺾�ƮڡA�N��g�Jq�}�C */ 
+		}
+	}
+	
+	return c;
+}
+
+
+int main() {
+    char str[100];
+    int poly_num , *q ,c , high;
+    init_f();
+
+    printf("\n*** �Ѧh��������Ʈ� ***\n\n��J�h���� ==> ");
+    
+    if (fgets(str, sizeof(str), stdin) == NULL) {
+        printf("��J���~�I\n");
+        return 1;
+    }
+
+
+/*	
+		1x^2-100x^0
+		1x^3-2x^2-1x^1+2x^0
+		1x^3-7x^2+4x^1+12x^0
+		1x^4+3x^3-66x^2+52x^1+120x^0
+		3x^4+9x^3-198x^2+156x^1+360x^0
+		1x^2-1x^1
+		2x^ 3 -201 x^2+ 97 x^1 +300
+		2x^12-195x^11-500x^10
+		6x^4 - 1x^3 -25x^2 + 4x^1 + 4 
+		1x^5-1x^3-1x^2-1x^1+1x^0
+		1x^5+1x^3+1x^2+1x^1+1x^0
+		1x^3+1x^0
+*/ 
+	
+    read_poly(str);
+    
+    current = head->rlink;
+	high= current->exp;
+    
+	show(q,c,0);
+	
+	q = (int *)malloc((high + 1) *sizeof(int)); /* p[1]�����̰����������ơA�̦��ȳЫب��������Ŷ����}�C�s��ҨD�o����Ʈ� */ 
+	
+	c = findRoot(q);
+	
+	if (c > 0) {
+		printf("\n\n�ѱo��Ʈڬ��G");
+		show(q,c,1);  
+	}
+	else
+		printf("\n\n��Ʈڤ��s�b\n");
+		
+    
+    
+	clear_node();
+   
+
+    return 0;
+}
diff --git a/作業/test/ds2_test.exe b/作業/test/ds2_test.exe
new file mode 100644
index 0000000..093b757
Binary files /dev/null and b/作業/test/ds2_test.exe differ
diff --git a/作業/test/fuzzy_HW1.c b/作業/test/fuzzy_HW1.c
new file mode 100644
index 0000000..15397cf
--- /dev/null
+++ b/作業/test/fuzzy_HW1.c
@@ -0,0 +1,74 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+int main(){
+	int a , i;
+	double u1 ,u2 , u1uu2 , u1iu2 , u1b , u2b , u1cu2b , u1bcu2;
+	
+//	for(i=0;i<11;i++){
+//		u1=exp(-(pow(i-4,2))/8);
+//		printf("u1(%d)=%f\n",i,u1);
+//	}
+//	printf("\n\n");
+//	for(i=0;i<11;i++){
+//		u2=exp(-(pow(i-8,2))/8);
+//		printf("u2(%d)=%f\n",i,u2);
+//	}
+
+//	for(i=0;i<11;i++){
+//		u1=exp(-(pow(i-4,2))/8);
+//		u2=exp(-(pow(i-8,2))/8);
+//		if(u1>u2){
+//			printf("u1uu2(%d)=%f\n",i,u1);
+//		}else{
+//			printf("u1uu2(%d)=%f\n",i,u2);
+//		}
+//	}
+//	printf("\n\n");
+//	for(i=0;i<11;i++){
+//		u1=exp(-(pow(i-4,2))/8);
+//		u2=exp(-(pow(i-8,2))/8);
+//		if(u1<u2){
+//			printf("u1iu2(%d)=%f\n",i,u1);
+//		}else{
+//			printf("u1iu2(%d)=%f\n",i,u2);
+//		}
+//	}
+	
+
+//	printf("\n\n");
+//	for(i=0;i<11;i++){
+//		u1b=1-(exp(-(pow(i-4,2))/8));
+//		printf("u1b(%d)=%f\n",i,u1b);
+//	}
+//	printf("\n\n");
+//	for(i=0;i<11;i++){
+//		u2b=1-(exp(-(pow(i-8,2))/8));
+//		printf("u2b(%d)=%f\n",i,u2b);
+//	}
+//	printf("\n\n");
+//
+	for(i=0;i<11;i++){
+		u1=exp(-(pow(i-4,2))/8);
+		u2b=1-(exp(-(pow(i-8,2))/8));
+		if(u1<u2b){
+			printf("u1cu2b(%d)=%f\n",i,u1);
+		}else{
+			printf("u1cu2b(%d)=%f\n",i,u2b);
+		}
+	}
+	
+	printf("\n\n");
+	for(i=0;i<11;i++){
+		u1b=1-(exp(-(pow(i-4,2))/8));
+		u2=exp(-(pow(i-8,2))/8);
+		if(u1b<u2){
+			printf("u1bcu2(%d)=%f\n",i,u1b);
+		}else{
+			printf("u1bcu2(%d)=%f\n",i,u2);
+		}
+	}
+	
+	return 0;
+}
diff --git a/作業/test/fuzzy_HW1.o b/作業/test/fuzzy_HW1.o
new file mode 100644
index 0000000..9764b10
Binary files /dev/null and b/作業/test/fuzzy_HW1.o differ
diff --git a/作業/test/mul_byme/Makefile.win b/作業/test/mul_byme/Makefile.win
new file mode 100644
index 0000000..40b53ad
--- /dev/null
+++ b/作業/test/mul_byme/Makefile.win
@@ -0,0 +1,28 @@
+# Project: Project1
+# Makefile created by Dev-C++ 5.11
+
+CPP      = g++.exe
+CC       = gcc.exe
+WINDRES  = windres.exe
+OBJ      = main.o
+LINKOBJ  = main.o
+LIBS     = -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib" -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/lib" -static-libgcc
+INCS     = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include"
+CXXINCS  = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include/c++"
+BIN      = Project1.exe
+CXXFLAGS = $(CXXINCS) 
+CFLAGS   = $(INCS) 
+RM       = rm.exe -f
+
+.PHONY: all all-before all-after clean clean-custom
+
+all: all-before $(BIN) all-after
+
+clean: clean-custom
+	${RM} $(OBJ) $(BIN)
+
+$(BIN): $(OBJ)
+	$(CC) $(LINKOBJ) -o $(BIN) $(LIBS)
+
+main.o: main.c
+	$(CC) -c main.c -o main.o $(CFLAGS)
diff --git a/作業/test/mul_byme/Project1.dev b/作業/test/mul_byme/Project1.dev
new file mode 100644
index 0000000..2cb70d4
--- /dev/null
+++ b/作業/test/mul_byme/Project1.dev
@@ -0,0 +1,62 @@
+[Project]
+FileName=Project1.dev
+Name=Project1
+Type=1
+Ver=2
+ObjFiles=
+Includes=
+Libs=
+PrivateResource=
+ResourceIncludes=
+MakeIncludes=
+Compiler=
+CppCompiler=
+Linker=
+IsCpp=0
+Icon=
+ExeOutput=
+ObjectOutput=
+LogOutput=
+LogOutputEnabled=0
+OverrideOutput=0
+OverrideOutputName=
+HostApplication=
+UseCustomMakefile=0
+CustomMakefile=
+CommandLine=
+Folders=
+IncludeVersionInfo=0
+SupportXPThemes=0
+CompilerSet=0
+CompilerSettings=0000000000000000000000000
+UnitCount=1
+
+[VersionInfo]
+Major=1
+Minor=0
+Release=0
+Build=0
+LanguageID=1033
+CharsetID=1252
+CompanyName=
+FileVersion=
+FileDescription=Developed using the Dev-C++ IDE
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=
+AutoIncBuildNr=0
+SyncProduct=1
+
+[Unit1]
+FileName=main.c
+CompileCpp=0
+Folder=
+Compile=1
+Link=1
+Priority=1000
+OverrideBuildCmd=0
+BuildCmd=
+
diff --git a/作業/test/mul_byme/Project1.exe b/作業/test/mul_byme/Project1.exe
new file mode 100644
index 0000000..827d046
Binary files /dev/null and b/作業/test/mul_byme/Project1.exe differ
diff --git a/作業/test/mul_byme/Project1.layout b/作業/test/mul_byme/Project1.layout
new file mode 100644
index 0000000..1ecfdb4
--- /dev/null
+++ b/作業/test/mul_byme/Project1.layout
@@ -0,0 +1,8 @@
+[Editors]
+Order=0
+Focused=0
+[Editor_0]
+CursorCol=21
+CursorRow=9
+TopLine=1
+LeftChar=1
diff --git a/作業/test/mul_byme/main.c b/作業/test/mul_byme/main.c
new file mode 100644
index 0000000..0bfac4a
--- /dev/null
+++ b/作業/test/mul_byme/main.c
@@ -0,0 +1,68 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+void mul (int **a,int**b,int **c, int m , int k , int n){
+	int i , j ,l , sum;
+	for (i=0;i<m;i++){
+		for (j=0;j<n;j++){
+			sum = 0;
+			for(l=0;l<k;l++){
+				sum += a[i][l]*b[l][j];
+			}c[i][j]=sum;
+		}
+	}
+}
+
+int main(){
+	int i , j ,m=2 , k=3 , n=4 ;
+	int a[2][3]={{1,2,7},{3,4,1}};
+	int b[3][4]={{5,6,2,4},{7,8,2,4},{7,2,6,1}};
+	
+	int **arr_a = (int**)malloc( m *sizeof(int*));
+	int **arr_b = (int**)malloc( k *sizeof(int*));
+	int **arr_c = (int**)malloc( m *sizeof(int*));
+	for (i=0;i<m;i++){
+		arr_a[i] = (int*)malloc( k *sizeof(int));
+		arr_c[i] = (int*)malloc( n *sizeof(int));
+	}
+	for (i=0;i<k;i++){
+		arr_b[i] = (int*)malloc( n *sizeof(int));
+	}
+	
+	for(i=0;i<m;i++){
+		for(j=0;j<k;j++){
+			arr_a[i][j] = a[i][j];
+		}
+	}
+	
+	for(i=0;i<k;i++){
+		for(j=0;j<n;j++){
+			arr_b[i][j] = b[i][j];
+		}
+	}
+	
+	
+	mul (arr_a,arr_b,arr_c,m,k,n);
+//	printf("%d\n",arr_b[2][2]);
+//	
+	for(i=0;i<m;i++){
+		for(j=0;j<n;j++){
+			printf("c[%d][%d]=%d\n",i,j,arr_c[i][j]);
+		}
+	}
+		
+	
+	free(arr_a);
+	free(arr_b);
+	free(arr_c);
+	for (i=0;i<m;i++){
+		free(arr_a[i]);
+		free(arr_c[i]);
+	}
+	for (i=0;i<k;i++){
+		free(arr_b[i]);
+	}
+	
+	
+	return 0 ;
+}
diff --git a/作業/test/mul_byme/main.o b/作業/test/mul_byme/main.o
new file mode 100644
index 0000000..f85a634
Binary files /dev/null and b/作業/test/mul_byme/main.o differ
diff --git a/作業/test/try.cpp b/作業/test/try.cpp
new file mode 100644
index 0000000..3bb8f57
--- /dev/null
+++ b/作業/test/try.cpp
@@ -0,0 +1,13 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+int main() {
+    printf("1+sin((-50.2+sin(3.8*20)*cos(-30-100%40))*(int)pow(2,-2.5))*cos(123.456) = %g\n",1+sin((-50.2+sin(3.8*20)*cos(-30-100%40))*pow(2,-2.5))*cos(123.456));
+    printf("sin((-50.2+sin(3.8*20) = %g\n",sin((-50.2+sin(3.8*20))));
+    
+    printf("\n*** �Ѧh��������Ʈ� ***\n\n��J�h���� ==> ");
+    
+//    1+sin((-50.2+sin(3.8*20)*cos(-30-100%40))*2^-2.5)*cos(123.456)
+    return 0;
+}
diff --git a/作業/test/try.exe b/作業/test/try.exe
new file mode 100644
index 0000000..ae3f629
Binary files /dev/null and b/作業/test/try.exe differ
diff --git a/作業/unit0/Makefile.win b/作業/unit0/Makefile.win
new file mode 100644
index 0000000..a8848bc
--- /dev/null
+++ b/作業/unit0/Makefile.win
@@ -0,0 +1,28 @@
+# Project: Project1
+# Makefile created by Dev-C++ 5.11
+
+CPP      = g++.exe -D__DEBUG__
+CC       = gcc.exe -D__DEBUG__
+WINDRES  = windres.exe
+OBJ      = Untitled1.o
+LINKOBJ  = Untitled1.o
+LIBS     = -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib" -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/lib" -static-libgcc -g3
+INCS     = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include"
+CXXINCS  = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include/c++"
+BIN      = unit0_bowling_1.exe
+CXXFLAGS = $(CXXINCS) -g3
+CFLAGS   = $(INCS) -g3
+RM       = rm.exe -f
+
+.PHONY: all all-before all-after clean clean-custom
+
+all: all-before $(BIN) all-after
+
+clean: clean-custom
+	${RM} $(OBJ) $(BIN)
+
+$(BIN): $(OBJ)
+	$(CC) $(LINKOBJ) -o $(BIN) $(LIBS)
+
+Untitled1.o: Untitled1.c
+	$(CC) -c Untitled1.c -o Untitled1.o $(CFLAGS)
diff --git a/作業/unit0/Untitled1.c b/作業/unit0/Untitled1.c
new file mode 100644
index 0000000..6db1285
--- /dev/null
+++ b/作業/unit0/Untitled1.c
@@ -0,0 +1,55 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<string.h>
+
+typedef struct game {  
+	char name[8]; /* ���ɪ̩m�W */
+	int  score;	  /* �o�� */
+}GAME;
+
+
+int main(){
+		
+	int i=0 ,j=0 ,n ;
+	GAME temp;
+	char input[20];
+	GAME * bowling = (GAME*)malloc(sizeof(GAME)); 
+	printf("��J���ɪ̸�T\n"); 
+	while(1){
+		
+		printf("��%d����ɪ̦W�r �o�� => ",i+1);
+		
+//		fgets(input,sizeof(input),stdin);
+		if(fgets(input,sizeof(input),stdin) == NULL||(strcmp(input,"\n")) == 0 ){
+			break;
+		}
+		
+		bowling = (GAME*)realloc(bowling ,(i+1)* sizeof(GAME)); 
+		sscanf(input,"%s%d",bowling[i].name,&bowling[i].score);
+		i++;
+		n=i;
+	}
+	
+	for(i=0;i<n;i++){
+		for(j=0;j<n-i-1;j++){
+			if(bowling[j].score<bowling[j+1].score){
+				temp = bowling[j+1];
+				bowling[j+1]=bowling[j];
+				bowling[j]=temp;
+			}
+		}
+	}
+	printf("���Z�Ʀ�\n");
+	printf("==============\n");
+	for(i=0;i<n;i++){
+		if(i+1==1) printf("%d. %s\t%d �a�x\n",i+1,bowling[i].name,bowling[i].score);
+		else if(i+1==2) printf("%d. %s\t%d �ȭx\n",i+1,bowling[i].name,bowling[i].score);
+		else if(i+1==3) printf("%d. %s\t%d �u�x\n",i+1,bowling[i].name,bowling[i].score);
+		else
+		printf("%d. %s\t%d\n",i+1,bowling[i].name,bowling[i].score);
+	}
+	
+	free(bowling);
+	return 0 ;
+}
+
diff --git a/作業/unit0/Untitled1.o b/作業/unit0/Untitled1.o
new file mode 100644
index 0000000..b60eecd
Binary files /dev/null and b/作業/unit0/Untitled1.o differ
diff --git a/作業/unit1/binary-search-solves-equation.exe b/作業/unit0/bowling-struct-gets-realloc-qsort.exe
similarity index 55%
rename from 作業/unit1/binary-search-solves-equation.exe
rename to 作業/unit0/bowling-struct-gets-realloc-qsort.exe
index 496ebc8..02a28af 100644
Binary files a/作業/unit1/binary-search-solves-equation.exe and b/作業/unit0/bowling-struct-gets-realloc-qsort.exe differ
diff --git a/作業/unit0/bowling-struct-sort.exe b/作業/unit0/bowling-struct-sort.exe
new file mode 100644
index 0000000..951235b
Binary files /dev/null and b/作業/unit0/bowling-struct-sort.exe differ
diff --git a/作業/unit0/bowling_1.c b/作業/unit0/bowling_1.c
new file mode 100644
index 0000000..e0f3aaa
--- /dev/null
+++ b/作業/unit0/bowling_1.c
@@ -0,0 +1,36 @@
+#include <stdio.h>
+
+typedef struct game {  
+	   char name[8]; /* ���ɪ̩m�W */
+	   int  score;	  /* �o�� */
+    }GAME;
+
+void bubble_sort(GAME arr[], int total) {
+	int i,j;
+    for (i = 0; i < total - 1; i++) {
+        for (j = 0; j < total - i - 1; j++) {
+            if (arr[j].score < arr[j + 1].score) {  
+                GAME temp = arr[j];
+                arr[j] = arr[j + 1];
+                arr[j + 1] = temp;
+            }
+        }
+    }
+}
+
+
+int main(){
+	GAME bowling[] = {{"Jack",198},{"Tom",185},{"Bob",210},{"Fred",205},{"Mary",170}};
+	int total =sizeof (bowling)/sizeof(bowling[0]);
+	
+	bubble_sort(bowling,total);
+	int i,j;
+
+	printf("���Z�Ʀ�\n");
+	printf("---------\n");
+	for(j=0;j<total;j++){
+		printf("%d. %s\t%d\n",j+1,bowling[j].name,bowling[j].score);
+	}
+	return 0;
+}
+
diff --git a/作業/unit0/bowling_1.exe b/作業/unit0/bowling_1.exe
new file mode 100644
index 0000000..a5a133e
Binary files /dev/null and b/作業/unit0/bowling_1.exe differ
diff --git a/作業/unit0/bowling_1.o b/作業/unit0/bowling_1.o
new file mode 100644
index 0000000..57c4ede
Binary files /dev/null and b/作業/unit0/bowling_1.o differ
diff --git a/作業/unit0/bowling_2.c b/作業/unit0/bowling_2.c
new file mode 100644
index 0000000..bd0b835
--- /dev/null
+++ b/作業/unit0/bowling_2.c
@@ -0,0 +1,67 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+typedef struct game {  
+    char name[8];  // ���ɪ̩m�W
+    int  score;    // �o��
+} GAME;
+
+int main() {
+    GAME *bowling = NULL;
+    int total = 0;         
+    int i, j;
+    char input[32];       
+
+    printf("�гv����J���ɪ̪���T...\n");
+    while (1) {
+        printf("��J��%d����ɪ̦W�r �o�� => ", total + 1);
+        
+        if (fgets(input, sizeof(input), stdin) == NULL) {
+            break;
+        }
+        
+        if (strcmp(input, "\n") == 0) {
+            break;
+        }
+
+        GAME *temp = realloc(bowling, (total + 1) * sizeof(GAME));
+        if (temp == NULL) {
+            printf("Memory allocation error\n");
+            free(bowling);
+            return 1;
+        }
+        bowling = temp;
+
+        sscanf(input, "%s %d", bowling[total].name, &bowling[total].score);
+        total++;
+    }
+
+    printf("\n���Z�ƦW\n============\n");
+    
+    // Sorting
+    for (i = 0; i < total - 1; i++) {
+        for (j = 0; j < total - i - 1; j++) {
+            if (bowling[j].score < bowling[j+1].score) {
+                GAME temp = bowling[j];
+                bowling[j] = bowling[j+1];
+                bowling[j+1] = temp;
+            }
+        }
+    }
+
+    // Printing results
+    for (i = 0; i < total; i++) {
+        if (i == 0)
+            printf("%d. %s %d �a�x\n", i + 1, bowling[i].name, bowling[i].score);
+        else if (i == 1)
+            printf("%d. %s %d �ȭx\n", i + 1, bowling[i].name, bowling[i].score);
+        else if (i == 2)
+            printf("%d. %s %d �u�x\n", i + 1, bowling[i].name, bowling[i].score);    
+        else
+            printf("%d. %s %d\n", i + 1, bowling[i].name, bowling[i].score);
+    }
+
+    free(bowling);
+    return 0;
+}
diff --git a/作業/unit0/bowling_2.exe b/作業/unit0/bowling_2.exe
new file mode 100644
index 0000000..3222215
Binary files /dev/null and b/作業/unit0/bowling_2.exe differ
diff --git a/作業/unit0/bowling_2.o b/作業/unit0/bowling_2.o
new file mode 100644
index 0000000..9da13a8
Binary files /dev/null and b/作業/unit0/bowling_2.o differ
diff --git a/作業/unit0/bowling_2_claude.c b/作業/unit0/bowling_2_claude.c
new file mode 100644
index 0000000..138f980
--- /dev/null
+++ b/作業/unit0/bowling_2_claude.c
@@ -0,0 +1,114 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+typedef struct Player {
+    char name[8];
+    int score;
+    struct Player* next;
+} Player;
+
+Player* createPlayer(const char* name, int score) {
+    Player* newPlayer = (Player*)malloc(sizeof(Player));
+    if (newPlayer == NULL) {
+        fprintf(stderr, "�O������t����\n");
+        exit(1);
+    }
+    strncpy(newPlayer->name, name, 7);
+    newPlayer->name[7] = '\0';
+    newPlayer->score = score;
+    newPlayer->next = NULL;
+    return newPlayer;
+}
+
+void addPlayer(Player** head, const char* name, int score) {
+    Player* newPlayer = createPlayer(name, score);
+    newPlayer->next = *head;
+    *head = newPlayer;
+}
+
+void sortPlayers(Player** head) {
+    int swapped;
+    Player* ptr1;
+    Player* lptr = NULL;
+
+    if (*head == NULL)
+        return;
+
+    do {
+        swapped = 0;
+        ptr1 = *head;
+
+        while (ptr1->next != lptr) {
+            if (ptr1->score < ptr1->next->score) {
+                int tempScore = ptr1->score;
+                char tempName[8];
+                strcpy(tempName, ptr1->name);
+
+                ptr1->score = ptr1->next->score;
+                strcpy(ptr1->name, ptr1->next->name);
+
+                ptr1->next->score = tempScore;
+                strcpy(ptr1->next->name, tempName);
+
+                swapped = 1;
+            }
+            ptr1 = ptr1->next;
+        }
+        lptr = ptr1;
+    } while (swapped);
+}
+
+void printResults(Player* head) {
+    printf("\n���Z�ƦW\n============\n");
+    int rank = 1;
+    while (head != NULL) {
+        if (rank == 1)
+            printf("%d. %s %d �a�x\n", rank, head->name, head->score);
+        else if (rank == 2)
+            printf("%d. %s %d �ȭx\n", rank, head->name, head->score);
+        else if (rank == 3)
+            printf("%d. %s %d �u�x\n", rank, head->name, head->score);
+        else
+            printf("%d. %s %d\n", rank, head->name, head->score);
+        head = head->next;
+        rank++;
+    }
+}
+
+void freeList(Player* head) {
+    Player* temp;
+    while (head != NULL) {
+        temp = head;
+        head = head->next;
+        free(temp);
+    }
+}
+
+int main() {
+    Player* head = NULL;
+    char input[32];
+    char name[8];
+    int score;
+
+    printf("�гv����J���ɪ̪���T...\n");
+
+    while (1) {
+        printf("��J���ɪ̦W�r �o���]�Ϋ�Enter�����^=> ");
+        if (fgets(input, sizeof(input), stdin) == NULL || strcmp(input, "\n") == 0) {
+            break;
+        }
+
+        if (sscanf(input, "%7s %d", name, &score) == 2) {
+            addPlayer(&head, name, score);
+        } else {
+            printf("��J�榡���~�A�Э��s��J�C\n");
+        }
+    }
+
+    sortPlayers(&head);
+    printResults(head);
+    freeList(head);
+
+    return 0;
+}
diff --git a/作業/unit0/bowling_2_claude.o b/作業/unit0/bowling_2_claude.o
new file mode 100644
index 0000000..798830a
Binary files /dev/null and b/作業/unit0/bowling_2_claude.o differ
diff --git a/作業/unit0/bowling_2_gpt.c b/作業/unit0/bowling_2_gpt.c
new file mode 100644
index 0000000..7ebfc12
--- /dev/null
+++ b/作業/unit0/bowling_2_gpt.c
@@ -0,0 +1,73 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+typedef struct game {  
+    char name[8];  // ���ɪ̩m�W
+    int  score;    // �o��
+} GAME;
+
+
+int main() {
+    GAME *bowling ;  // �ʺA���t�O���骺����
+    int total = 0;         // ���ɪ̼ƶq
+    int i , j ,temp;
+    char input[32];        // �Ȧs�ΨӳB�z��J
+
+    printf("�гv����J���ɪ̪���T...\n");
+    while (1) {
+        // ���ܿ�J���ɪ̦W�ٻP�o��
+        printf("��J��%d����ɪ̦W�r �o�� => ", total + 1);
+        
+        // Ū���@���J
+        fgets(input, sizeof(input), stdin);
+        
+        // �Y���U<Enter>����������J�A������J�L�{
+        if (strcmp(input, "\n") == 0) {
+            break;
+        }
+
+        // �ʺA���t�O����Ŷ��H�O�s�s�����ɪ̸��
+        bowling = (GAME *)malloc( (total + 1) * sizeof(GAME));
+		
+//		printf("���t���O�����}: %p\n", (void *)bowling);
+		
+        // �ѪR��J���W�٩M�o��
+        sscanf(input, "%s %d", bowling[total].name, &bowling[total].score);
+
+        total++;
+    }
+
+    // ��ܿ�J���G
+    
+    
+    
+    printf("\n���Z�ƦW\n============\n");
+    
+	for (i=0 ; i<total-1;i++){
+		for(j=0 ; j<total-i-1;j++){
+			if (bowling[j].score<bowling[j+1].score){
+				temp = bowling[j+1].score;
+				bowling[j+1].score = bowling[j].score;
+				bowling[j].score = temp;
+			}
+		}
+	}
+
+    for (i = 0; i < total; i++) {
+    	if(i + 1==1)
+    		printf("%d. %s %d �a�x\n", i + 1, bowling[i].name, bowling[i].score);
+    	else if(i + 1==2)
+			printf("%d. %s %d �ȭx\n", i + 1, bowling[i].name, bowling[i].score);
+		else if(i + 1==3)
+			printf("%d. %s %d �u�x\n", i + 1, bowling[i].name, bowling[i].score);	
+		else if	(i + 1 >3) 
+        	printf("%d. %s %d\n", i + 1, bowling[i].name, bowling[i].score);
+    }
+
+    // ����ʺA�O����
+    free(bowling);
+
+    return 0;
+}
+
diff --git a/作業/unit0/bowling_2_gpt.exe b/作業/unit0/bowling_2_gpt.exe
new file mode 100644
index 0000000..d3b0d53
Binary files /dev/null and b/作業/unit0/bowling_2_gpt.exe differ
diff --git a/作業/unit0/bowling_2_gpt.o b/作業/unit0/bowling_2_gpt.o
new file mode 100644
index 0000000..687ba76
Binary files /dev/null and b/作業/unit0/bowling_2_gpt.o differ
diff --git a/作業/unit0/pointer_func.c b/作業/unit0/pointer_func.c
new file mode 100644
index 0000000..0ee180e
--- /dev/null
+++ b/作業/unit0/pointer_func.c
@@ -0,0 +1,30 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void swap(int *,int *);
+
+int main(){
+	
+	int x=14,y=62;
+	int ptr_a = &x,ptr_b = &y;
+	
+	printf("Initial ...\n");
+	printf("x=%d , y=%d\n",x,y);
+	swap (&x,&y);
+	
+	printf("\nEnd swap ...\n");
+	printf("x=%d , y=%d\n",x,y);
+	return 0;
+}
+
+void swap(int *a,int *b){
+	int temp;
+	printf("\nin swap ...\n");
+	printf("a=%d , b=%d\n",*a,*b);
+	temp = *a;
+	*a=*b;
+	*b=temp;
+	printf("\nafter swap ...\n");
+	printf("a=%d , b=%d\n",*a,*b);
+}
+
diff --git a/作業/unit0/pointer_func.o b/作業/unit0/pointer_func.o
new file mode 100644
index 0000000..44cffda
Binary files /dev/null and b/作業/unit0/pointer_func.o differ
diff --git a/作業/unit0/unit0_bowling_1.dev b/作業/unit0/unit0_bowling_1.dev
new file mode 100644
index 0000000..1607cfa
--- /dev/null
+++ b/作業/unit0/unit0_bowling_1.dev
@@ -0,0 +1,62 @@
+[Project]
+FileName=unit0_bowling_1.dev
+Name=Project1
+Type=1
+Ver=2
+ObjFiles=
+Includes=
+Libs=
+PrivateResource=
+ResourceIncludes=
+MakeIncludes=
+Compiler=
+CppCompiler=
+Linker=
+IsCpp=0
+Icon=
+ExeOutput=
+ObjectOutput=
+LogOutput=
+LogOutputEnabled=0
+OverrideOutput=0
+OverrideOutputName=
+HostApplication=
+UseCustomMakefile=0
+CustomMakefile=
+CommandLine=
+Folders=
+IncludeVersionInfo=0
+SupportXPThemes=0
+CompilerSet=0
+CompilerSettings=0000000000000000001000000
+UnitCount=1
+
+[VersionInfo]
+Major=1
+Minor=0
+Release=0
+Build=0
+LanguageID=1033
+CharsetID=1252
+CompanyName=
+FileVersion=
+FileDescription=Developed using the Dev-C++ IDE
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=
+AutoIncBuildNr=0
+SyncProduct=1
+
+[Unit1]
+FileName=Untitled1.c
+CompileCpp=0
+Folder=
+Compile=1
+Link=1
+Priority=1000
+OverrideBuildCmd=0
+BuildCmd=
+
diff --git a/作業/unit0/unit0_bowling_1.exe b/作業/unit0/unit0_bowling_1.exe
new file mode 100644
index 0000000..89d1ec4
Binary files /dev/null and b/作業/unit0/unit0_bowling_1.exe differ
diff --git a/作業/unit0/unit0_bowling_1.layout b/作業/unit0/unit0_bowling_1.layout
new file mode 100644
index 0000000..3097a4e
--- /dev/null
+++ b/作業/unit0/unit0_bowling_1.layout
@@ -0,0 +1,13 @@
+[Editors]
+Order=0
+Focused=0
+[Editor_0]
+CursorCol=76
+CursorRow=23
+TopLine=7
+LeftChar=1
+[Editor_1]
+CursorCol=1
+CursorRow=1
+TopLine=1
+LeftChar=1
diff --git a/作業/unit1/binary-search-solves-equation.o b/作業/unit1/binary-search-solves-equation.o
deleted file mode 100644
index 33075b9..0000000
Binary files a/作業/unit1/binary-search-solves-equation.o and /dev/null differ
diff --git a/作業/unit1/binary-search-solves-equation/Makefile.win b/作業/unit1/binary-search-solves-equation/Makefile.win
new file mode 100644
index 0000000..9dbc7a2
--- /dev/null
+++ b/作業/unit1/binary-search-solves-equation/Makefile.win
@@ -0,0 +1,28 @@
+# Project: Project1
+# Makefile created by Dev-C++ 5.11
+
+CPP      = g++.exe
+CC       = gcc.exe
+WINDRES  = windres.exe
+OBJ      = test_3.o
+LINKOBJ  = test_3.o
+LIBS     = -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib" -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/lib" -static-libgcc
+INCS     = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include"
+CXXINCS  = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include/c++"
+BIN      = Project1.exe
+CXXFLAGS = $(CXXINCS) 
+CFLAGS   = $(INCS) 
+RM       = rm.exe -f
+
+.PHONY: all all-before all-after clean clean-custom
+
+all: all-before $(BIN) all-after
+
+clean: clean-custom
+	${RM} $(OBJ) $(BIN)
+
+$(BIN): $(OBJ)
+	$(CC) $(LINKOBJ) -o $(BIN) $(LIBS)
+
+test_3.o: test_3.cpp
+	$(CC) -c test_3.cpp -o test_3.o $(CFLAGS)
diff --git a/作業/unit1/binary-search-solves-equation/Project1.dev b/作業/unit1/binary-search-solves-equation/Project1.dev
new file mode 100644
index 0000000..83e966c
--- /dev/null
+++ b/作業/unit1/binary-search-solves-equation/Project1.dev
@@ -0,0 +1,52 @@
+[Project]
+FileName=Project1.dev
+Name=Project1
+Type=1
+Ver=2
+ObjFiles=
+Includes=
+Libs=
+PrivateResource=
+ResourceIncludes=
+MakeIncludes=
+Compiler=
+CppCompiler=
+Linker=
+IsCpp=0
+Icon=
+ExeOutput=
+ObjectOutput=
+LogOutput=
+LogOutputEnabled=0
+OverrideOutput=0
+OverrideOutputName=
+HostApplication=
+UseCustomMakefile=0
+CustomMakefile=
+CommandLine=
+Folders=
+IncludeVersionInfo=0
+SupportXPThemes=0
+CompilerSet=0
+CompilerSettings=0000000000000000000000000
+UnitCount=0
+
+[VersionInfo]
+Major=1
+Minor=0
+Release=0
+Build=0
+LanguageID=1033
+CharsetID=1252
+CompanyName=
+FileVersion=
+FileDescription=Developed using the Dev-C++ IDE
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=
+AutoIncBuildNr=0
+SyncProduct=1
+
diff --git a/作業/unit1/binary-search-solves-equation/Project1.layout b/作業/unit1/binary-search-solves-equation/Project1.layout
new file mode 100644
index 0000000..852965c
--- /dev/null
+++ b/作業/unit1/binary-search-solves-equation/Project1.layout
@@ -0,0 +1,13 @@
+[Editor_1]
+CursorCol=3
+CursorRow=40
+TopLine=16
+LeftChar=1
+[Editor_0]
+CursorCol=11
+CursorRow=10
+TopLine=1
+LeftChar=1
+[Editors]
+Order=
+Focused=0
diff --git a/作業/unit1/binary-search-solves-equation.c b/作業/unit1/binary-search-solves-equation/binary-search-solves-equation.c
similarity index 87%
rename from 作業/unit1/binary-search-solves-equation.c
rename to 作業/unit1/binary-search-solves-equation/binary-search-solves-equation.c
index a1a14a9..5b00ed3 100644
--- a/作業/unit1/binary-search-solves-equation.c
+++ b/作業/unit1/binary-search-solves-equation/binary-search-solves-equation.c
@@ -2,8 +2,8 @@
 #include <stdlib.h>
 #include <math.h>
 
-#define f(x) (x+sin(x)-1)
-//#define f(x) ((x)*(x))
+//#define f(x) (x+sin(x)-1)
+#define f(x) ((x)*(x))
 //#define f(x) ((x)*exp(x)*(x)*exp(x))
 
 int main() {
@@ -14,9 +14,6 @@ int main() {
 	printf("���N\t�϶�\t\t\t\t������\n");
 	printf("-------+-------------------------------+-------------\n");
 	
-	printf("%.10f\n",f(num));
-	
-	//�Ѭ�0.510973
 	if(f(num)==(num+sin(num)-1)){
 		while (upper - lower > precision && i < count ) {
 	    mid = (lower + upper) / 2.0;  
@@ -36,12 +33,11 @@ int main() {
 		}
 	}
 	
-	//�Ѭ�0 
 	if(f(num)==(num*num)){
 		while (upper - lower > precision && i < count ) {
 	    mid = (lower + upper) / 2.0;  
 	    printf("#%d\t[%.10f,%.10f]\t��=%.10f\n",i+1,lower,upper,mid);
-//	    printf("\nf(mid)=%.10f, f(lower)=%.10f, f(upper)=%.10f\n",f(mid),f(lower),f(upper));
+	    printf("\nf(mid)=%.10f, f(lower)=%.10f, f(upper)=%.10f\n",f(mid),f(lower),f(upper));
 	    
 	    if (fabs(f(mid)) < precision) {
         	break;
@@ -58,7 +54,6 @@ int main() {
 		}
 	}
 	
-	//�ߤ@�Ѭ�0,�ͪ�ѩҦ����p��-5���t��  
 	if(f(num)==((num)*exp(num)*(num)*exp(num))){
 		while (upper - lower > precision && i < count ) {
 	    mid = (lower + upper) / 2.0;  
diff --git a/作業/unit1/binary-search-solves-equation/binary-search-solves-equation.o b/作業/unit1/binary-search-solves-equation/binary-search-solves-equation.o
new file mode 100644
index 0000000..eee68e9
Binary files /dev/null and b/作業/unit1/binary-search-solves-equation/binary-search-solves-equation.o differ
diff --git a/作業/unit1/binary-search-solves-equation/main.c b/作業/unit1/binary-search-solves-equation/main.c
new file mode 100644
index 0000000..41934e9
--- /dev/null
+++ b/作業/unit1/binary-search-solves-equation/main.c
@@ -0,0 +1,79 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+//#define f(x) (x+sin(x)-1)
+//#define f(x) ((x)*(x))
+#define f(x) ((x)*exp(x)*(x)*exp(x))
+
+int main() {
+	int count = 1000 , i=0;
+	double precision = 1e-10 ;
+	//num����ܸѭ��Ӥ�{�� 
+	double mid , lower=-20 , upper=100, num=2;
+	
+	if(f(num)==(num+sin(num)-1)){
+		while (upper - lower > precision && i < count ) {
+	    mid = (lower + upper) / 2.0;  
+
+	    printf("#%d\t[%.10f,%.10f]\t��=%.10f\n",i+1,lower,upper,mid);
+	    
+	    if (fabs(f(mid)) < precision) {
+        	break;
+        }
+        	
+	    i++;
+	    if ( f(mid) * f(lower) < 0) {
+	    	upper = mid;
+	    } else {
+	    	lower = mid;
+	    	}
+		}
+	}
+	
+	if(f(num)==(num*num)){
+		while (upper - lower > precision && i < count ) {
+	    mid = (lower + upper) / 2.0;  
+
+	    printf("\n#%d\t[%.10f,%.10f]\t��=%.10f\n",i+1,lower,upper,mid);
+	    printf("\nf(mid)=%f, f(lower)=%f, f(upper)=%f\n",f(mid),f(lower),f(upper));
+	    
+	    if (fabs(f(mid)) < precision) {
+        	break;
+        }
+        	
+	    i++;
+	    if ( f(mid) > precision) {
+	    	if(mid>0){
+	    		upper = mid;
+	    } else if(mid<0){
+				lower = mid;
+				}
+	    	}
+		}
+	}
+	
+	if(f(num)==((num)*exp(num)*(num)*exp(num))){
+		while (upper - lower > precision && i < count ) {
+	    mid = (lower + upper) / 2.0;  
+
+	    printf("#%d\t[%.10f,%.10f]\t��=%.10f\n",i+1,lower,upper,mid);
+//	    printf("mid=%.10f,f(mid)=%.10f\n",mid,f(mid));
+	    if (fabs(f(mid)) < precision) {
+        	break;
+        }
+        	
+	    i++;
+	    if ( f(mid) > precision) {
+	    	if(mid>0){
+	    		upper = mid;
+	    } else if(mid<0){
+				lower = mid;
+				}
+	    	}
+		}
+	}
+		
+	printf("\n���׬�%f",mid);
+	return 0;
+}
diff --git a/作業/unit1/binary-search-solves-equation/main.o b/作業/unit1/binary-search-solves-equation/main.o
new file mode 100644
index 0000000..5052b45
Binary files /dev/null and b/作業/unit1/binary-search-solves-equation/main.o differ
diff --git a/作業/unit1/binary-search-solves-equation/test.c b/作業/unit1/binary-search-solves-equation/test.c
new file mode 100644
index 0000000..d81fecc
--- /dev/null
+++ b/作業/unit1/binary-search-solves-equation/test.c
@@ -0,0 +1,34 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+#define f(x) ((x) + sin(x) - 1)
+
+int main() {
+    int count = 1000, i = 0;
+    double precision = 1e-15;
+    double epsilon = 1e-15;
+    double mid, lower = 0, upper = 2;
+    
+    while ((upper - lower > precision) && (i < count)) {
+        mid = (lower + upper) / 2.0;
+        double f_mid = f(mid);
+        
+        printf("#%d\t[%.15f,%.15f]\t��=%.15f\tf(mid)=%.15e\n", i+1, lower, upper, mid, f_mid);
+        
+        if (fabs(f_mid) < epsilon) {
+            break;
+        }
+        
+        i++;
+        if (f_mid * f(lower) < 0) {
+            upper = mid;
+        } else {
+            lower = mid;
+        }
+    }
+    
+    printf("���׬�%.15f\n", mid);
+    printf("f(mid) = %.15e\n", f(mid));
+    return 0;
+}
diff --git a/作業/unit1/binary-search-solves-equation/test.o b/作業/unit1/binary-search-solves-equation/test.o
new file mode 100644
index 0000000..d8c694f
Binary files /dev/null and b/作業/unit1/binary-search-solves-equation/test.o differ
diff --git a/作業/unit1/binary-search-solves-equation/test_1.c b/作業/unit1/binary-search-solves-equation/test_1.c
new file mode 100644
index 0000000..7f616bb
--- /dev/null
+++ b/作業/unit1/binary-search-solves-equation/test_1.c
@@ -0,0 +1,49 @@
+#include <stdio.h>
+#include <math.h>
+
+#define EPSILON 1e-6
+#define MAX_ITERATIONS 100
+
+double f(double x, double a) {
+    return x * x - a;
+}
+
+double bisection_method(double a, double left, double right) {
+    double mid;
+    int iterations = 0;
+
+    while (right - left > EPSILON && iterations < MAX_ITERATIONS) {
+        mid = (left + right) / 2;
+        
+        if (f(mid, a) == 0.0) {
+            return mid;
+        } else if (f(mid, a) * f(left, a) < 0) {
+            right = mid;
+        } else {
+            left = mid;
+        }
+        
+        iterations++;
+    }
+
+    return (left + right) / 2;
+}
+
+int main() {
+    double a, result;
+
+    printf("�п�J�@�ӥ��� a �ӨD�� x^2 = a: ");
+    scanf("%lf", &a);
+
+    if (a < 0) {
+        printf("���~�Ga �����O�D�t��\n");
+        return 1;
+    }
+
+    result = bisection_method(a, 0, a > 1 ? a : 1);
+
+    printf("��{ x^2 = %.6f ���Ѭ��� x = %.6f\n", a, result);
+    printf("���ҡG%.6f^2 = %.6f\n", result, result * result);
+
+    return 0;
+}
diff --git a/作業/unit1/binary-search-solves-equation/test_1.o b/作業/unit1/binary-search-solves-equation/test_1.o
new file mode 100644
index 0000000..7cf53c1
Binary files /dev/null and b/作業/unit1/binary-search-solves-equation/test_1.o differ
diff --git a/作業/unit1/binary-search-solves-equation/test_2.c b/作業/unit1/binary-search-solves-equation/test_2.c
new file mode 100644
index 0000000..1e17f87
--- /dev/null
+++ b/作業/unit1/binary-search-solves-equation/test_2.c
@@ -0,0 +1,32 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<>
+int main(){
+	double x,mid ,precision=1e-10;
+	int i=0, count=1000;
+	printf("��Jx��");
+	scanf("%lf",&x);
+	double upper=x,lower=0;
+	mid=(upper+lower)/2;
+	
+	while (fabs((mid*mid)-x)> precision && i < count){
+		mid=(upper+lower)/2;
+		printf("#%d\t[%f,%f]\t��=%f\n",i+1,lower,upper,mid);
+		i++;
+		if(fabs(mid-x) <precision){
+			break;
+		}else if(mid*mid>x){
+			upper=mid;
+//			lower=mid;
+		}else{
+//			upper=mid;
+			lower=mid;
+				
+		}
+		
+		
+			
+	}
+	printf("%f",mid);
+	return 0;
+} 
diff --git a/作業/unit1/binary-search-solves-equation/test_2.o b/作業/unit1/binary-search-solves-equation/test_2.o
new file mode 100644
index 0000000..e7e33b1
Binary files /dev/null and b/作業/unit1/binary-search-solves-equation/test_2.o differ
diff --git a/作業/unit1/binary-search-solves-equation/test_3.cpp b/作業/unit1/binary-search-solves-equation/test_3.cpp
new file mode 100644
index 0000000..e60fe80
--- /dev/null
+++ b/作業/unit1/binary-search-solves-equation/test_3.cpp
@@ -0,0 +1,44 @@
+#include <iostream>
+#include <iomanip>
+#include <cmath>
+#define f(x) ((x) * (x) - a) // �w�q��{�� f(x) 
+
+using namespace std;
+
+int main() {
+	
+	double a;
+    cout << "����ڪ��ƭ� a= ";
+    cin >> a;
+    cout << "----------------------------------------"<< endl;
+    double c=sqrt(a);
+    double left = 0, right = 20; // �]�w�d��
+    double b = 1e-10; 
+    double mid;
+    int i = 0;
+
+    while ((right - left) > b) {
+        mid = (left + right) / 2.0;
+        i++;
+        printf("#%d [%f  %f ]\n", i, left, right);
+
+        if (f(mid) == 0.0) {
+            cout << "�ڪ�����Ȭ�: " << mid << " �B f(x)= " << f(mid) << endl;
+            return 0;
+        }
+
+        if (f(left) * f(mid) < 0) {
+            right = mid; // ����
+        } else {
+            left = mid; // �k��
+        }
+    }
+    cout << "-----------------------------------------"<< endl;
+    int d=((mid - c) / (c)) * 100 ;
+    if(d>0)
+      d=d;
+    else
+      d=-d;
+    cout << "sqrt("<< a <<"): " << sqrt(a) << " �~�t�Ȭ�(%)" << d << endl;
+    return 0;
+}
diff --git a/作業/unit1/binary-search-solves-equation/test_3.o b/作業/unit1/binary-search-solves-equation/test_3.o
new file mode 100644
index 0000000..18e2568
Binary files /dev/null and b/作業/unit1/binary-search-solves-equation/test_3.o differ
diff --git a/作業/unit1/binary-search-square-root/Makefile.win b/作業/unit1/binary-search-square-root/Makefile.win
new file mode 100644
index 0000000..c93a9d6
--- /dev/null
+++ b/作業/unit1/binary-search-square-root/Makefile.win
@@ -0,0 +1,28 @@
+# Project: Project1
+# Makefile created by Dev-C++ 5.11
+
+CPP      = g++.exe
+CC       = gcc.exe
+WINDRES  = windres.exe
+OBJ      = binary-search-square-root.o
+LINKOBJ  = binary-search-square-root.o
+LIBS     = -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib" -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/lib" -static-libgcc
+INCS     = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include"
+CXXINCS  = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include/c++"
+BIN      = Project1.exe
+CXXFLAGS = $(CXXINCS) 
+CFLAGS   = $(INCS) 
+RM       = rm.exe -f
+
+.PHONY: all all-before all-after clean clean-custom
+
+all: all-before $(BIN) all-after
+
+clean: clean-custom
+	${RM} $(OBJ) $(BIN)
+
+$(BIN): $(OBJ)
+	$(CC) $(LINKOBJ) -o $(BIN) $(LIBS)
+
+binary-search-square-root.o: binary-search-square-root.c
+	$(CC) -c binary-search-square-root.c -o binary-search-square-root.o $(CFLAGS)
diff --git a/作業/unit1/binary-search-square-root/Project1.dev b/作業/unit1/binary-search-square-root/Project1.dev
new file mode 100644
index 0000000..95433df
--- /dev/null
+++ b/作業/unit1/binary-search-square-root/Project1.dev
@@ -0,0 +1,62 @@
+[Project]
+FileName=Project1.dev
+Name=Project1
+Type=1
+Ver=2
+ObjFiles=
+Includes=
+Libs=
+PrivateResource=
+ResourceIncludes=
+MakeIncludes=
+Compiler=
+CppCompiler=
+Linker=
+IsCpp=0
+Icon=
+ExeOutput=
+ObjectOutput=
+LogOutput=
+LogOutputEnabled=0
+OverrideOutput=0
+OverrideOutputName=
+HostApplication=
+UseCustomMakefile=0
+CustomMakefile=
+CommandLine=
+Folders=
+IncludeVersionInfo=0
+SupportXPThemes=0
+CompilerSet=0
+CompilerSettings=0000000000000000000000000
+UnitCount=1
+
+[VersionInfo]
+Major=1
+Minor=0
+Release=0
+Build=0
+LanguageID=1033
+CharsetID=1252
+CompanyName=
+FileVersion=
+FileDescription=Developed using the Dev-C++ IDE
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=
+AutoIncBuildNr=0
+SyncProduct=1
+
+[Unit1]
+FileName=E:\���Ѯv�Ч�\�@�~\unit1\binary-search-square-root.c
+CompileCpp=0
+Folder=
+Compile=1
+Link=1
+Priority=1000
+OverrideBuildCmd=0
+BuildCmd=
+
diff --git a/作業/unit1/binary-search-square-root.exe b/作業/unit1/binary-search-square-root/Project1.exe
similarity index 98%
rename from 作業/unit1/binary-search-square-root.exe
rename to 作業/unit1/binary-search-square-root/Project1.exe
index 4fd176d..59a3ef9 100644
Binary files a/作業/unit1/binary-search-square-root.exe and b/作業/unit1/binary-search-square-root/Project1.exe differ
diff --git a/作業/unit1/binary-search-square-root/Project1.layout b/作業/unit1/binary-search-square-root/Project1.layout
new file mode 100644
index 0000000..a52f300
--- /dev/null
+++ b/作業/unit1/binary-search-square-root/Project1.layout
@@ -0,0 +1,8 @@
+[Editor_0]
+CursorCol=2
+CursorRow=18
+TopLine=1
+LeftChar=1
+[Editors]
+Order=0
+Focused=0
diff --git a/作業/unit1/binary-search-square-root.c b/作業/unit1/binary-search-square-root/binary-search-square-root.c
similarity index 97%
rename from 作業/unit1/binary-search-square-root.c
rename to 作業/unit1/binary-search-square-root/binary-search-square-root.c
index c232726..f5786f3 100644
--- a/作業/unit1/binary-search-square-root.c
+++ b/作業/unit1/binary-search-square-root/binary-search-square-root.c
@@ -34,7 +34,7 @@ int main() {
 	}
 	
 	if(x<1){
-		lower=0 , upper=1 ,i=0;
+		lower=x , upper=1 ,i=0;
 		printf("\n�ϥΤG���j�M�k�D�ѹL�{�p�U...\n");
 		printf("\n���N\t�϶�\t\t\t\t������\n");
 		printf("-------+-------------------------------+-------------\n");
diff --git a/作業/unit1/binary-search-square-root.o b/作業/unit1/binary-search-square-root/binary-search-square-root.o
similarity index 100%
rename from 作業/unit1/binary-search-square-root.o
rename to 作業/unit1/binary-search-square-root/binary-search-square-root.o
diff --git a/作業/unit1/binary-search-square-root/main.c b/作業/unit1/binary-search-square-root/main.c
new file mode 100644
index 0000000..8ddf853
--- /dev/null
+++ b/作業/unit1/binary-search-square-root/main.c
@@ -0,0 +1,52 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+int main() {
+	int i;
+	double precision = 1e-10 , x;
+	
+	printf("***��Jx��(x>0)�p�⥭���***\n");
+	printf("��Jx��=> ");
+	scanf("%lf",&x);
+	double mid , lower , upper;
+
+	
+	if(x<0){
+		printf("���~! X�Ȥ���<1");
+		return 1;
+	}
+	
+	if(x>1){
+		lower=0 , upper=x , i=0;
+		while (upper - lower > precision) {
+		    mid = (lower + upper) / 2.0;  
+		    printf("#%d\t[%.10f,%.10f]\t��=%.10f\n",i+1,lower,upper,mid);
+		    i++;
+		    if (mid * mid > x) {
+		        upper = mid;
+		    } else {
+		        lower = mid;
+		    }
+		}
+	}
+	
+	if(x<1){
+		lower=x , upper=1 ,i=0;
+		while (upper - lower > precision) {
+		    mid = (lower + upper) / 2.0;  
+		    printf("#%d\t[%.10f,%.10f]\t��=%.10f\n",i+1,lower,upper,mid);
+		    i++;
+		    if (mid * mid > x) {
+		        upper = mid;
+		    } else {
+		        lower = mid;
+		    }
+		}
+	}
+	
+	printf("%f������ڬ�%.10f\n",x,mid);
+	printf("sqrt(%f)�����G��%.10f\n",x,sqrt(x));
+	
+	return 0;
+}
diff --git a/作業/unit1/binary-search-square-root/main.o b/作業/unit1/binary-search-square-root/main.o
new file mode 100644
index 0000000..698dc95
Binary files /dev/null and b/作業/unit1/binary-search-square-root/main.o differ
diff --git a/作業/unit1/binary-search-square-root/test.c b/作業/unit1/binary-search-square-root/test.c
new file mode 100644
index 0000000..50f2778
--- /dev/null
+++ b/作業/unit1/binary-search-square-root/test.c
@@ -0,0 +1,44 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+int main() {
+    int x;
+    double precision = 1e-5;
+    
+    printf("***��Jx��(x>0)�p�⥭���***\n");
+    
+    // �M�ſ�J�w�İ�
+    int c;
+    while ((c = getchar()) != '\n' && c != EOF);
+    
+    // �ϥ� fgets �M sscanf ��Ū����J
+    char input[100];
+    if (fgets(input, sizeof(input), stdin) == NULL) {
+        printf("Ū����J�ɵo�Ϳ��~\n");
+        return 1;
+    }
+    
+    if (sscanf(input, "%d", &x) != 1 || x <= 0) {
+        printf("�L�Ī���J�C�п�J�@�ӥ���ơC\n");
+        return 1;
+    }
+
+    int lower = 0, upper = x;
+    double ans = sqrt(x);
+    double mid;
+
+    while (upper - lower > precision) {
+        mid = (lower + upper) / 2.0;
+        if (mid * mid > x) {
+            upper = mid;
+        } else {
+            lower = mid;
+        }
+    }
+    
+    printf("%d������ڬ�%f\n", x, mid);
+    printf("sqrt(%d)�����G��%f\n", x, ans);
+
+    return 0;
+}
diff --git a/作業/unit1/binary-search-square-root/test.o b/作業/unit1/binary-search-square-root/test.o
new file mode 100644
index 0000000..e73f98c
Binary files /dev/null and b/作業/unit1/binary-search-square-root/test.o differ
diff --git a/作業/unit1/matrix multiplication/Makefile.win b/作業/unit1/matrix multiplication/Makefile.win
new file mode 100644
index 0000000..dca9b0a
--- /dev/null
+++ b/作業/unit1/matrix multiplication/Makefile.win	
@@ -0,0 +1,28 @@
+# Project: Project3
+# Makefile created by Dev-C++ 5.11
+
+CPP      = g++.exe
+CC       = gcc.exe
+WINDRES  = windres.exe
+OBJ      = test3.o
+LINKOBJ  = test3.o
+LIBS     = -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib" -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/lib" -static-libgcc
+INCS     = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include"
+CXXINCS  = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include/c++"
+BIN      = Project3.exe
+CXXFLAGS = $(CXXINCS) 
+CFLAGS   = $(INCS) 
+RM       = rm.exe -f
+
+.PHONY: all all-before all-after clean clean-custom
+
+all: all-before $(BIN) all-after
+
+clean: clean-custom
+	${RM} $(OBJ) $(BIN)
+
+$(BIN): $(OBJ)
+	$(CC) $(LINKOBJ) -o $(BIN) $(LIBS)
+
+test3.o: test3.c
+	$(CC) -c test3.c -o test3.o $(CFLAGS)
diff --git a/作業/unit1/matrix multiplication/Project3.dev b/作業/unit1/matrix multiplication/Project3.dev
new file mode 100644
index 0000000..3c704c8
--- /dev/null
+++ b/作業/unit1/matrix multiplication/Project3.dev	
@@ -0,0 +1,62 @@
+[Project]
+FileName=Project3.dev
+Name=Project3
+Type=1
+Ver=2
+ObjFiles=
+Includes=
+Libs=
+PrivateResource=
+ResourceIncludes=
+MakeIncludes=
+Compiler=
+CppCompiler=
+Linker=
+IsCpp=0
+Icon=
+ExeOutput=
+ObjectOutput=
+LogOutput=
+LogOutputEnabled=0
+OverrideOutput=0
+OverrideOutputName=
+HostApplication=
+UseCustomMakefile=0
+CustomMakefile=
+CommandLine=
+Folders=
+IncludeVersionInfo=0
+SupportXPThemes=0
+CompilerSet=0
+CompilerSettings=0000000000000000000000000
+UnitCount=1
+
+[VersionInfo]
+Major=1
+Minor=0
+Release=0
+Build=0
+LanguageID=1033
+CharsetID=1252
+CompanyName=
+FileVersion=
+FileDescription=Developed using the Dev-C++ IDE
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=
+AutoIncBuildNr=0
+SyncProduct=1
+
+[Unit1]
+FileName=E:\���Ѯv�Ч�\�@�~\matrix-multiplication\matrix-multiplication.c
+CompileCpp=0
+Folder=
+Compile=1
+Link=1
+Priority=1000
+OverrideBuildCmd=0
+BuildCmd=
+
diff --git a/作業/unit1/matrix-multiplication/matrix-multiplication.exe b/作業/unit1/matrix multiplication/Project3.exe
similarity index 64%
rename from 作業/unit1/matrix-multiplication/matrix-multiplication.exe
rename to 作業/unit1/matrix multiplication/Project3.exe
index 33e786d..a543c96 100644
Binary files a/作業/unit1/matrix-multiplication/matrix-multiplication.exe and b/作業/unit1/matrix multiplication/Project3.exe differ
diff --git a/作業/unit1/matrix multiplication/Project3.layout b/作業/unit1/matrix multiplication/Project3.layout
new file mode 100644
index 0000000..ede1280
--- /dev/null
+++ b/作業/unit1/matrix multiplication/Project3.layout	
@@ -0,0 +1,18 @@
+[Editor_1]
+CursorCol=17
+CursorRow=3
+TopLine=1
+LeftChar=1
+[Editors]
+Order=0
+Focused=0
+[Editor_0]
+CursorCol=16
+CursorRow=74
+TopLine=64
+LeftChar=1
+[Editor_2]
+CursorCol=26
+CursorRow=41
+TopLine=1
+LeftChar=1
diff --git a/作業/unit1/matrix multiplication/by_me.c b/作業/unit1/matrix multiplication/by_me.c
new file mode 100644
index 0000000..1b7b395
--- /dev/null
+++ b/作業/unit1/matrix multiplication/by_me.c	
@@ -0,0 +1,69 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+void mul(int **a ,int **b,int **c ,int m , int k ,int n){
+	int i , j , l ,sum;
+	
+	for (i=0;i<m;i++){
+		for(j=0;j<n;j++){
+			sum = 0;
+			for(l=0;l<k;l++){
+				sum += a[i][l]*b[l][j];
+			}c[i][j]=sum; 
+		}
+	}
+}
+
+int main(){
+	int i , j ,m=2,k=3,n=4;
+	
+	int a[2][3]={{1,2,7},{3,4,1}};
+	int b[3][4]={{5,6,2,4},{7,8,2,4},{7,2,6,1}};
+
+	
+	int **arr_a = (int**)malloc(m * sizeof(int*));
+	int **arr_b = (int**)malloc(k * sizeof(int*));
+	int **arr_c = (int**)malloc(m * sizeof(int*));
+	for(i=0;i<m;i++){
+		arr_a[i] = (int*)malloc(k*sizeof(int));		
+		arr_c[i] = (int*)malloc(n*sizeof(int));
+	}
+	for(i=0;i<k;i++){
+		arr_b[i] = (int*)malloc(n*sizeof(int));
+	}
+	
+	for (i=0;i<m;i++){
+		for(j=0;j<k;j++){
+			arr_a[i][j]=a[i][j];		
+		}
+	}
+	for (i=0;i<k;i++){
+		for(j=0;j<n;j++){
+			arr_b[i][j]=b[i][j];		
+		}
+	}
+	
+	
+	mul(arr_a,arr_b,arr_c,m,k,n);
+	
+	for (i=0;i<m;i++){
+		for(j=0;j<n;j++){
+			printf("c[%d][%d]=%d\n",i,j,arr_c[i][j]);
+		}
+	}
+	
+	
+	free (arr_a);
+	free (arr_b);
+	free (arr_c);
+	
+	for(i=0;i<m;i++){
+		free (arr_a[i]);
+		free (arr_c[i]);
+	}
+	for(i=0;i<k;i++){
+		free (arr_b[i]);
+	}
+	
+	return 0 ;
+}
diff --git a/作業/unit1/matrix multiplication/by_me.exe b/作業/unit1/matrix multiplication/by_me.exe
new file mode 100644
index 0000000..ba4bd94
Binary files /dev/null and b/作業/unit1/matrix multiplication/by_me.exe differ
diff --git a/作業/unit1/matrix multiplication/by_me.o b/作業/unit1/matrix multiplication/by_me.o
new file mode 100644
index 0000000..6fe9eb5
Binary files /dev/null and b/作業/unit1/matrix multiplication/by_me.o differ
diff --git a/作業/unit1/matrix multiplication/by_me_2.c b/作業/unit1/matrix multiplication/by_me_2.c
new file mode 100644
index 0000000..5e70128
--- /dev/null
+++ b/作業/unit1/matrix multiplication/by_me_2.c	
@@ -0,0 +1,128 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define MAX_LINE_LENGTH 1000
+
+// ���t�x�}�O����
+int** allocateMatrix(int rows, int cols) {
+	int i;
+    int** matrix = (int**)malloc(rows * sizeof(int*));
+    for (i = 0; i < rows; i++) {
+        matrix[i] = (int*)malloc(cols * sizeof(int));
+    }
+    return matrix;
+}
+
+// ����x�}�O����
+void freeMatrix(int** matrix, int rows) {
+	int i ;
+    for (i = 0; i < rows; i++) {
+        free(matrix[i]);
+    }
+    free(matrix);
+}
+
+// �x�}���k
+void mul(int **a, int **b, int **c, int m, int k, int n) {
+	int i , j , l ;
+    for (i = 0; i < m; i++) {
+        for (j = 0; j < n; j++) {
+            c[i][j] = 0;
+            for (l = 0; l < k; l++) {
+                c[i][j] += a[i][l] * b[l][j];
+            }
+        }
+    }
+}
+
+// Ū���x�}�ê�^����
+int** readMatrix(FILE* file, int* rows, int* cols) {
+    char line[MAX_LINE_LENGTH];
+    int** matrix = NULL;
+    *rows = 0;
+    *cols = 0;
+
+    while (fgets(line, sizeof(line), file)) {
+        if (strlen(line) <= 1) break;  // �Ŧ���ܯx�}����
+
+        (*rows)++;
+        int tempCols = 0;
+        char* token = strtok(line, " \t\n");
+        
+        while (token != NULL) {
+            tempCols++;
+            token = strtok(NULL, " \t\n");
+        }
+
+        if (*cols == 0) {
+            *cols = tempCols;
+            matrix = allocateMatrix(*rows, *cols);
+        }
+
+        if (tempCols != *cols) {
+            printf("���~�G�x�}�C�Ƥ��@�P\n");
+            exit(1);
+        }
+
+        // ���sŪ���Ӧ�æs�x�ƾ�
+        int col = 0;
+        token = strtok(line, " \t\n");
+        while (token != NULL) {
+            matrix[*rows - 1][col++] = atoi(token);
+            token = strtok(NULL, " \t\n");
+        }
+    }
+
+    return matrix;
+}
+
+int main() {
+	int i , j ;
+    FILE *file = fopen("matrix_input.txt", "r");
+    if (file == NULL) {
+        printf("�L�k�}���ɮ�\n");
+        return 1;
+    }
+
+    int m, k1, k2, n;
+    int **arr_a, **arr_b, **arr_c;
+
+    // Ū���Ĥ@�ӯx�}
+    arr_a = readMatrix(file, &m, &k1);
+
+    // Ū���ĤG�ӯx�}
+    arr_b = readMatrix(file, &k2, &n);
+
+    fclose(file);
+
+    // �ˬd�x�}�O�_�i�H�ۭ�
+    if (k1 != k2) {
+        printf("���~�G�o��ӯx�}�L�k�ۭ�\n");
+        freeMatrix(arr_a, m);
+        freeMatrix(arr_b, k2);
+        return 1;
+    }
+
+    // ���t���G�x�}���Ŷ�
+    arr_c = allocateMatrix(m, n);
+
+    // ����x�}���k
+    mul(arr_a, arr_b, arr_c, m, k1, n);
+
+    // ��X���G
+    printf("�x�}���k���G�G\n");
+    for (i = 0; i < m; i++) {
+        for (j = 0; j < n; j++) {
+            printf("%d ", arr_c[i][j]);
+        }
+        printf("\n");
+    }
+
+    // ����O����
+    freeMatrix(arr_a, m);
+    freeMatrix(arr_b, k1);
+    freeMatrix(arr_c, m);
+
+    return 0;
+}
diff --git a/作業/unit1/matrix multiplication/by_me_2.o b/作業/unit1/matrix multiplication/by_me_2.o
new file mode 100644
index 0000000..0ef738d
Binary files /dev/null and b/作業/unit1/matrix multiplication/by_me_2.o differ
diff --git a/作業/unit1/matrix multiplication/main.c b/作業/unit1/matrix multiplication/main.c
new file mode 100644
index 0000000..8f8d4d8
--- /dev/null
+++ b/作業/unit1/matrix multiplication/main.c	
@@ -0,0 +1,72 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void mul(int **a, int **b, int **c, int n) {
+    int i, j, k, sum;
+    for (i = 0; i < n; i++) {
+        for (j = 0; j < n; j++) {
+            sum = 0;
+            for (k = 0; k < n; k++) {
+                sum += a[i][k] * b[k][j];
+            }
+            c[i][j] = sum;
+        }
+    }
+}
+
+int main() {
+    int i, j, n = 2;
+    
+    int ary_a[2][2]={{1,2},{3,4}};
+    int ary_b[2][2]={{5,6},{7,8}};
+    
+    // �ʺA���t�O���鵹�x�}
+    int **arr_a = (int **)malloc(n * sizeof(int *));
+    int **arr_b = (int **)malloc(n * sizeof(int *));
+    int **arr_c = (int **)malloc(n * sizeof(int *));
+    
+	if (arr_a == NULL || arr_b == NULL || arr_c == NULL) {
+        printf("�O������t����\n");
+        return 1;
+    }
+    
+    for (i = 0; i < n; i++) {
+        arr_a[i] = (int *)malloc(n * sizeof(int));
+        arr_b[i] = (int *)malloc(n * sizeof(int));
+        arr_c[i] = (int *)malloc(n * sizeof(int));
+        
+        if (arr_a[i] == NULL || arr_b[i] == NULL || arr_c[i] == NULL) {
+        printf("�O������t����\n");
+        return 1;
+    	}
+    }
+    
+	for (i = 0; i < 2; i++) {
+	        for (j = 0; j < 2; j++) {
+	            arr_a[i][j] = ary_a[i][j];
+	            arr_b[i][j] = ary_b[i][j];
+	        }
+	    }
+    
+    // �i��x�}���k
+    mul(arr_a, arr_b, arr_c, n);
+    
+    // ��X���G
+    for (i = 0; i < n; i++) {
+        for (j = 0; j < n; j++) {
+            printf("arr_c[%d][%d] = %d\n", i, j, arr_c[i][j]);
+        }
+    }
+    
+    // ����O����
+    for (i = 0; i < n; i++) {
+        free(arr_a[i]);
+        free(arr_b[i]);
+        free(arr_c[i]);
+    }
+    free(arr_a);
+    free(arr_b);
+    free(arr_c);
+    
+    return 0;
+}
diff --git a/作業/unit1/matrix multiplication/main.exe b/作業/unit1/matrix multiplication/main.exe
new file mode 100644
index 0000000..980b144
Binary files /dev/null and b/作業/unit1/matrix multiplication/main.exe differ
diff --git a/作業/unit1/matrix multiplication/main.o b/作業/unit1/matrix multiplication/main.o
new file mode 100644
index 0000000..46bfcb9
Binary files /dev/null and b/作業/unit1/matrix multiplication/main.o differ
diff --git a/作業/unit1/matrix-product.c b/作業/unit1/matrix multiplication/matrix-product.c
similarity index 100%
rename from 作業/unit1/matrix-product.c
rename to 作業/unit1/matrix multiplication/matrix-product.c
diff --git a/作業/unit1/matrix multiplication/matrix-product.o b/作業/unit1/matrix multiplication/matrix-product.o
new file mode 100644
index 0000000..d6cabd4
Binary files /dev/null and b/作業/unit1/matrix multiplication/matrix-product.o differ
diff --git a/作業/unit1/matrix-multiplication/matrix_input.txt b/作業/unit1/matrix multiplication/matrix_input.txt
similarity index 88%
rename from 作業/unit1/matrix-multiplication/matrix_input.txt
rename to 作業/unit1/matrix multiplication/matrix_input.txt
index 48f0cc9..16cfc87 100644
--- a/作業/unit1/matrix-multiplication/matrix_input.txt
+++ b/作業/unit1/matrix multiplication/matrix_input.txt	
@@ -1,5 +1,5 @@
 1 2 3 4
-5 6 7 8
+5 6 7 5
 9 10 11 12
 
 -1 -2 -3 
diff --git a/作業/unit1/matrix multiplication/read_data_byme.c b/作業/unit1/matrix multiplication/read_data_byme.c
new file mode 100644
index 0000000..b568394
--- /dev/null
+++ b/作業/unit1/matrix multiplication/read_data_byme.c	
@@ -0,0 +1,21 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<string>
+
+define colMAX 100
+define rowMAX 100
+
+int main(){
+	int i , j ;
+	FILE *file;
+	char line;
+	if((file = fopen("matrix_input.txt","r"))==NULL){
+		return 1 ;
+	}	
+	fget(line,sizeof(line),file);
+	
+	
+	
+	
+	return 0;
+}
diff --git a/作業/unit1/matrix multiplication/read_matrix.c b/作業/unit1/matrix multiplication/read_matrix.c
new file mode 100644
index 0000000..e19dfca
--- /dev/null
+++ b/作業/unit1/matrix multiplication/read_matrix.c	
@@ -0,0 +1,160 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+void mul(int **a, int **b, int **c, int m, int k, int n) {
+	int i , j , l ;
+    for (i = 0; i < m; i++) {
+        for (j = 0; j < n; j++) {
+            c[i][j] = 0;
+            for (l = 0; l < k; l++) {
+                c[i][j] += a[i][l] * b[l][j];
+            }
+        }
+    }
+}
+
+void read_matrix(FILE *file,int *m,int *k,int *n){
+	char line[1000];
+//	int *m = 0, *k1 = 0, *k2 = 0, *n = 0;
+	int *k1 , *k2;
+	int i, j, temp;
+	char *token;
+	
+	while (fgets(line, sizeof(line), file)) {
+        if (strlen(line) <= 1) {
+        	break; 
+		}
+        j = 0;
+        token = strtok(line, " \n");
+        while (token != NULL) {
+			j++;
+            token = strtok(NULL, " \n");
+        }
+        if (*k1 == 0) *k1 = j;
+        m++;
+        
+    }
+    // Ū���ĤG�ӯx�}
+    while (fgets(line, sizeof(line), file)) {
+        j = 0;
+        token = strtok(line, " \n");
+        while (token != NULL) {
+			j++;
+            token = strtok(NULL, " \n");
+        }
+        if (*n == 0) *n = j;
+        k2++;
+        *k2 = k2;
+    }
+    printf("OK");
+//    if (*k1!=*k2) return 1;
+//    if (*k1==*k2){	
+}
+
+int main() {
+    FILE *file ;
+    
+    int *m , *k , *n ;
+    int i, j, temp;
+    char *token;
+
+    if ((file = fopen("matrix_input.txt", "r")) == NULL){
+        printf("�L�k���}���\n");
+        return 1;
+    }
+
+    // Ū���Ĥ@�ӯx�}
+//    while (fgets(line, sizeof(line), file)) {
+//        if (strlen(line) <= 1) {
+//        	break; 
+//		}
+//        j = 0;
+//        token = strtok(line, " \n");
+//        while (token != NULL) {
+//			j++;
+//            token = strtok(NULL, " \n");
+//        }
+//        if (k1 == 0) k1 = j;
+//		
+//        m++;
+//    }
+//
+//    // Ū���ĤG�ӯx�}
+//    while (fgets(line, sizeof(line), file)) {
+//        j = 0;
+//        token = strtok(line, " \n");
+//        while (token != NULL) {
+//			j++;
+//            token = strtok(NULL, " \n");
+//        }
+//        if (n == 0)	n = j;
+//        k2++;
+//    }
+
+	read_matrix(file,&m,&k,&n);
+	
+    printf("�Ĥ@�ӯx�}: %d �� %d �C\n", *m, *k);
+	printf("�ĤG�ӯx�}: %d �� %d �C\n", *k, *n);
+	printf("m = %d, k1 = %d, k2 = %d, n = %d\n\n", *m, *k , *k , *n);
+    
+    
+	//�ھ�m,k,n�t�m�O����Ŷ� 
+	int **arr_a = (int**)malloc(m * sizeof(int*));
+	int **arr_b = (int**)malloc(k * sizeof(int*));
+	int **arr_c = (int**)malloc(m * sizeof(int*));
+	for(i=0;i<m;i++){
+		arr_a[i] = (int*)malloc(k*sizeof(int));		
+		arr_c[i] = (int*)malloc(n*sizeof(int));
+	}
+	for(i=0;i<k;i++){
+		arr_b[i] = (int*)malloc(n*sizeof(int));
+	}
+	    
+	    
+//		for (i = 0; i < m; i++) {
+//            for (j = 0; j < k1; j++) {
+//                arr_a[i][j] = matrix1[i][j];
+//            }
+//        }
+//
+//        for (i = 0; i < k2; i++) {
+//            for (j = 0; j < n; j++) {
+//                arr_b[i][j] = matrix2[i][j];
+//            }
+//        }
+	    
+	    mul(arr_a,arr_b,arr_c,m,k,n);
+	    
+//	    printf("%d\n",arr_a[0][1]);
+//	    printf("%d\n",arr_b[0][1]);
+//	    printf("%d\n",arr_c[0][1]);
+	    
+	    for(i=0;i<m;i++){
+	    	for(j=0;j<n;j++){
+	    		printf("c[%d][%d]=%d\n",i,j,arr_c[i][j]);
+			}
+		}
+	    
+	    fclose(file);
+		
+		free (arr_a);
+		free (arr_b);
+		free (arr_c);
+		for(i=0;i<m;i++){
+			free (arr_a[i]);
+			free (arr_c[i]);
+		}
+		for(i=0;i<k;i++){
+			free (arr_b[i]);
+		}
+	
+
+//    if(k1!=k2){
+//    	printf("���~! �x�}�L�k�ۭ�\n");
+//    	fclose(file);
+//    	return 1;
+//	}
+	
+    return 0;
+}
diff --git a/作業/unit1/matrix multiplication/read_matrix.o b/作業/unit1/matrix multiplication/read_matrix.o
new file mode 100644
index 0000000..c1173c5
Binary files /dev/null and b/作業/unit1/matrix multiplication/read_matrix.o differ
diff --git a/作業/unit1/matrix multiplication/test1.c b/作業/unit1/matrix multiplication/test1.c
new file mode 100644
index 0000000..5e70128
--- /dev/null
+++ b/作業/unit1/matrix multiplication/test1.c	
@@ -0,0 +1,128 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define MAX_LINE_LENGTH 1000
+
+// ���t�x�}�O����
+int** allocateMatrix(int rows, int cols) {
+	int i;
+    int** matrix = (int**)malloc(rows * sizeof(int*));
+    for (i = 0; i < rows; i++) {
+        matrix[i] = (int*)malloc(cols * sizeof(int));
+    }
+    return matrix;
+}
+
+// ����x�}�O����
+void freeMatrix(int** matrix, int rows) {
+	int i ;
+    for (i = 0; i < rows; i++) {
+        free(matrix[i]);
+    }
+    free(matrix);
+}
+
+// �x�}���k
+void mul(int **a, int **b, int **c, int m, int k, int n) {
+	int i , j , l ;
+    for (i = 0; i < m; i++) {
+        for (j = 0; j < n; j++) {
+            c[i][j] = 0;
+            for (l = 0; l < k; l++) {
+                c[i][j] += a[i][l] * b[l][j];
+            }
+        }
+    }
+}
+
+// Ū���x�}�ê�^����
+int** readMatrix(FILE* file, int* rows, int* cols) {
+    char line[MAX_LINE_LENGTH];
+    int** matrix = NULL;
+    *rows = 0;
+    *cols = 0;
+
+    while (fgets(line, sizeof(line), file)) {
+        if (strlen(line) <= 1) break;  // �Ŧ���ܯx�}����
+
+        (*rows)++;
+        int tempCols = 0;
+        char* token = strtok(line, " \t\n");
+        
+        while (token != NULL) {
+            tempCols++;
+            token = strtok(NULL, " \t\n");
+        }
+
+        if (*cols == 0) {
+            *cols = tempCols;
+            matrix = allocateMatrix(*rows, *cols);
+        }
+
+        if (tempCols != *cols) {
+            printf("���~�G�x�}�C�Ƥ��@�P\n");
+            exit(1);
+        }
+
+        // ���sŪ���Ӧ�æs�x�ƾ�
+        int col = 0;
+        token = strtok(line, " \t\n");
+        while (token != NULL) {
+            matrix[*rows - 1][col++] = atoi(token);
+            token = strtok(NULL, " \t\n");
+        }
+    }
+
+    return matrix;
+}
+
+int main() {
+	int i , j ;
+    FILE *file = fopen("matrix_input.txt", "r");
+    if (file == NULL) {
+        printf("�L�k�}���ɮ�\n");
+        return 1;
+    }
+
+    int m, k1, k2, n;
+    int **arr_a, **arr_b, **arr_c;
+
+    // Ū���Ĥ@�ӯx�}
+    arr_a = readMatrix(file, &m, &k1);
+
+    // Ū���ĤG�ӯx�}
+    arr_b = readMatrix(file, &k2, &n);
+
+    fclose(file);
+
+    // �ˬd�x�}�O�_�i�H�ۭ�
+    if (k1 != k2) {
+        printf("���~�G�o��ӯx�}�L�k�ۭ�\n");
+        freeMatrix(arr_a, m);
+        freeMatrix(arr_b, k2);
+        return 1;
+    }
+
+    // ���t���G�x�}���Ŷ�
+    arr_c = allocateMatrix(m, n);
+
+    // ����x�}���k
+    mul(arr_a, arr_b, arr_c, m, k1, n);
+
+    // ��X���G
+    printf("�x�}���k���G�G\n");
+    for (i = 0; i < m; i++) {
+        for (j = 0; j < n; j++) {
+            printf("%d ", arr_c[i][j]);
+        }
+        printf("\n");
+    }
+
+    // ����O����
+    freeMatrix(arr_a, m);
+    freeMatrix(arr_b, k1);
+    freeMatrix(arr_c, m);
+
+    return 0;
+}
diff --git a/作業/unit1/matrix multiplication/test1.o b/作業/unit1/matrix multiplication/test1.o
new file mode 100644
index 0000000..d0d9bf1
Binary files /dev/null and b/作業/unit1/matrix multiplication/test1.o differ
diff --git a/作業/unit1/matrix multiplication/test2.c b/作業/unit1/matrix multiplication/test2.c
new file mode 100644
index 0000000..f735b93
--- /dev/null
+++ b/作業/unit1/matrix multiplication/test2.c	
@@ -0,0 +1,109 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <ctype.h>
+
+#define MAX_SIZE 10 /* �w�q�x�}���̤j�j�p */
+
+/* ��ơGŪ���x�} */
+int readMatrix(int matrix[MAX_SIZE][MAX_SIZE], int *cols, FILE *file) {
+    int i = 0, j = 0, temp;
+    char ch;
+    
+    while (fscanf(file, "%d", &temp) == 1) {
+        matrix[i][j] = temp;
+        j++;
+        
+        /* �ˬd���e��O�_���� */
+        ch = fgetc(file);
+        if (ch == '\n') {
+            if (i == 0) {
+                *cols = j;  // �����Ĥ@�檺�C��
+            }
+            i++;  /* ����U�@�� */
+            j = 0; /* ���m�C�p�� */
+        }
+        if (ch == EOF) break;
+    }
+    return i; /* ��^��� */
+}
+
+/* ��ơG���L�Ŧ� */
+void skipEmptyLines(FILE *file) {
+    char ch;
+    while ((ch = fgetc(file)) != EOF) {
+        if (!isspace(ch) || ch == '\n') {
+            ungetc(ch, file); // �N�D�ťզr�Űh�^�y�A�dzƤU�@��Ū��
+            break;
+        }
+    }
+}
+
+/* ��ơG�L�X�x�} */
+void printMatrix(int matrix[MAX_SIZE][MAX_SIZE], int rows, int cols) {
+    int i, j;
+    for (i = 0; i < rows; i++) {
+        for (j = 0; j < cols; j++) {
+            printf("%d ", matrix[i][j]);
+        }
+        printf("\n");
+    }
+}
+
+/* ��ơG�x�}���k */
+void multiplyMatrix(int a[MAX_SIZE][MAX_SIZE], int b[MAX_SIZE][MAX_SIZE], int c[MAX_SIZE][MAX_SIZE], 
+                    int rowsA, int colsA, int colsB) {
+    int i, j, k;
+    for (i = 0; i < rowsA; i++) {
+        for (j = 0; j < colsB; j++) {
+            c[i][j] = 0;
+            for (k = 0; k < colsA; k++) {
+                c[i][j] += a[i][k] * b[k][j];
+            }
+        }
+    }
+}
+
+int main() {
+    FILE *file;
+    int matrixA[MAX_SIZE][MAX_SIZE] = {0}, matrixB[MAX_SIZE][MAX_SIZE] = {0}, result[MAX_SIZE][MAX_SIZE] = {0};
+    int rowsA = 0, colsA = 0, rowsB = 0, colsB = 0;
+
+    /* �}���ɮ� */
+    file = fopen("matrix_input.txt", "r");
+    if (file == NULL) {
+        printf("�L�k�}���ɮ�\n");
+        return 1;
+    }
+
+    /* Ū���x�} A */
+    rowsA = readMatrix(matrixA, &colsA, file);
+
+    /* ���L�Ŧ� */
+    skipEmptyLines(file);
+
+    /* Ū���x�} B */
+    rowsB = readMatrix(matrixB, &colsB, file);
+
+    /* �����ɮ� */
+    fclose(file);
+
+    /* �L�X�x�}�j�p */
+    printf("�x�} A: %d x %d\n", rowsA, colsA);
+    printf("�x�} B: %d x %d\n", rowsB, colsB);
+
+    /* �ˬd�x�}�O�_�i�H�ۭ� */
+    if (colsA != rowsB) {
+        printf("���~�G�o��ӯx�}�L�k�ۭ�\n");
+        return 1;
+    }
+
+    /* ����x�}���k */
+    multiplyMatrix(matrixA, matrixB, result, rowsA, colsA, colsB);
+
+    /* �L�X���G */
+    printf("�x�}���k���G�G\n");
+    printMatrix(result, rowsA, colsB);
+
+    return 0;
+}
+
diff --git a/作業/unit1/matrix multiplication/test2.o b/作業/unit1/matrix multiplication/test2.o
new file mode 100644
index 0000000..e286f52
Binary files /dev/null and b/作業/unit1/matrix multiplication/test2.o differ
diff --git a/作業/unit1/matrix-multiplication/matrix-multiplication.c b/作業/unit1/matrix multiplication/test3.c
similarity index 98%
rename from 作業/unit1/matrix-multiplication/matrix-multiplication.c
rename to 作業/unit1/matrix multiplication/test3.c
index 4b14e19..25126d8 100644
--- a/作業/unit1/matrix-multiplication/matrix-multiplication.c
+++ b/作業/unit1/matrix multiplication/test3.c	
@@ -111,8 +111,8 @@ int main() {
     read_matrix(file, arr_b, k, n);
 
     mul(arr_a, arr_b, arr_c, m, k, n);
-	
-    printf("�x�}�ۭ����G�G\n");
+
+    printf("���G�x�}�G\n");
     for (i = 0; i < m; i++) {
         for (j = 0; j < n; j++) {
             printf("%d ", arr_c[i][j]);
@@ -132,6 +132,6 @@ int main() {
     for (i = 0; i < k; i++) {
         free(arr_b[i]);
     }
-    system("pause");
+    
     return 0;
 }
diff --git a/作業/unit1/matrix multiplication/test3.exe b/作業/unit1/matrix multiplication/test3.exe
new file mode 100644
index 0000000..0416f1e
Binary files /dev/null and b/作業/unit1/matrix multiplication/test3.exe differ
diff --git a/作業/unit1/matrix multiplication/test3.o b/作業/unit1/matrix multiplication/test3.o
new file mode 100644
index 0000000..0dedeb6
Binary files /dev/null and b/作業/unit1/matrix multiplication/test3.o differ
diff --git a/作業/unit1/matrix-multiplication.zip b/作業/unit1/matrix-multiplication.zip
deleted file mode 100644
index 4b48eb5..0000000
Binary files a/作業/unit1/matrix-multiplication.zip and /dev/null differ
diff --git a/作業/unit1/停機問題.docx b/作業/unit1/停機問題.docx
deleted file mode 100644
index dc8ffe2..0000000
Binary files a/作業/unit1/停機問題.docx and /dev/null differ
diff --git a/作業/unit12/.vscode/c_cpp_properties.json b/作業/unit12/.vscode/c_cpp_properties.json
new file mode 100644
index 0000000..cea4d3f
--- /dev/null
+++ b/作業/unit12/.vscode/c_cpp_properties.json
@@ -0,0 +1,18 @@
+{
+  "configurations": [
+    {
+      "name": "windows-gcc-x64",
+      "includePath": [
+        "${workspaceFolder}/**"
+      ],
+      "compilerPath": "gcc",
+      "cStandard": "${default}",
+      "cppStandard": "${default}",
+      "intelliSenseMode": "windows-gcc-x64",
+      "compilerArgs": [
+        ""
+      ]
+    }
+  ],
+  "version": 4
+}
\ No newline at end of file
diff --git a/作業/unit12/.vscode/launch.json b/作業/unit12/.vscode/launch.json
new file mode 100644
index 0000000..373bd65
--- /dev/null
+++ b/作業/unit12/.vscode/launch.json
@@ -0,0 +1,24 @@
+{
+  "version": "0.2.0",
+  "configurations": [
+    {
+      "name": "C/C++ Runner: Debug Session",
+      "type": "cppdbg",
+      "request": "launch",
+      "args": [],
+      "stopAtEntry": false,
+      "externalConsole": true,
+      "cwd": "e:/code/C++/unit12",
+      "program": "e:/code/C++/unit12/build/Debug/outDebug",
+      "MIMode": "gdb",
+      "miDebuggerPath": "gdb",
+      "setupCommands": [
+        {
+          "description": "Enable pretty-printing for gdb",
+          "text": "-enable-pretty-printing",
+          "ignoreFailures": true
+        }
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/作業/unit12/.vscode/settings.json b/作業/unit12/.vscode/settings.json
new file mode 100644
index 0000000..c9e66f1
--- /dev/null
+++ b/作業/unit12/.vscode/settings.json
@@ -0,0 +1,59 @@
+{
+  "C_Cpp_Runner.cCompilerPath": "gcc",
+  "C_Cpp_Runner.cppCompilerPath": "g++",
+  "C_Cpp_Runner.debuggerPath": "gdb",
+  "C_Cpp_Runner.cStandard": "",
+  "C_Cpp_Runner.cppStandard": "",
+  "C_Cpp_Runner.msvcBatchPath": "C:/Program Files/Microsoft Visual Studio/2022/Community/VC/Auxiliary/Build/vcvarsall.bat",
+  "C_Cpp_Runner.useMsvc": false,
+  "C_Cpp_Runner.warnings": [
+    "-Wall",
+    "-Wextra",
+    "-Wpedantic",
+    "-Wshadow",
+    "-Wformat=2",
+    "-Wcast-align",
+    "-Wconversion",
+    "-Wsign-conversion",
+    "-Wnull-dereference"
+  ],
+  "C_Cpp_Runner.msvcWarnings": [
+    "/W4",
+    "/permissive-",
+    "/w14242",
+    "/w14287",
+    "/w14296",
+    "/w14311",
+    "/w14826",
+    "/w44062",
+    "/w44242",
+    "/w14905",
+    "/w14906",
+    "/w14263",
+    "/w44265",
+    "/w14928"
+  ],
+  "C_Cpp_Runner.enableWarnings": true,
+  "C_Cpp_Runner.warningsAsError": false,
+  "C_Cpp_Runner.compilerArgs": [],
+  "C_Cpp_Runner.linkerArgs": [],
+  "C_Cpp_Runner.includePaths": [],
+  "C_Cpp_Runner.includeSearch": [
+    "*",
+    "**/*"
+  ],
+  "C_Cpp_Runner.excludeSearch": [
+    "**/build",
+    "**/build/**",
+    "**/.*",
+    "**/.*/**",
+    "**/.vscode",
+    "**/.vscode/**"
+  ],
+  "C_Cpp_Runner.useAddressSanitizer": false,
+  "C_Cpp_Runner.useUndefinedSanitizer": false,
+  "C_Cpp_Runner.useLeakSanitizer": false,
+  "C_Cpp_Runner.showCompilationTime": false,
+  "C_Cpp_Runner.useLinkTimeOptimization": false,
+  "C_Cpp_Runner.msvcSecureNoWarnings": false
+}
\ No newline at end of file
diff --git a/作業/unit12/DS7.cpp b/作業/unit12/DS7.cpp
new file mode 100644
index 0000000..d75c2ee
--- /dev/null
+++ b/作業/unit12/DS7.cpp
@@ -0,0 +1,135 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+
+#define MAX_V 100   /*�̤j�`�I��*/
+#define Infinite 1073741823
+
+long int dist[MAX_V+1][MAX_V+1];
+int N;  // �`�I�ƶq
+int source, sink;  // �_�I�M���I
+
+void init();
+bool floydWarshall();
+void output_path();
+void output_step();
+
+int main() {
+	
+    init();
+    
+    // �ˬd�O�_�s�b�t�v�j��
+    if (floydWarshall()) {
+    	output_path();
+        printf("\n�ϧΤ��s�b�t�v�j���A�L�k�p��̵u���|\n");
+    } else {
+        output_path();
+    }
+    
+    return 0;
+}
+
+void init(){
+    FILE *fptr;
+    int i, j, weight;
+
+    fptr = fopen("shortestPath.dat", "r");
+    if (fptr == NULL) {
+        perror("shortestPath.dat");
+        exit(1);
+    }
+
+    fscanf(fptr, "%d", &N);  // Ū���ϧθ`�I��
+
+    // ��l�ƶZ���x�}
+    for (i = 1; i <= N; i++) {
+        for (j = 1; j <= N; j++) {
+            if (i == j)
+                dist[i][j] = 0;  // �ۨ���ۨ����Z����0
+            else
+                dist[i][j] = Infinite;  // ��L�w�]���L�a�j
+        }
+    }
+	
+    // Ū���䪺�v��
+    while (fscanf(fptr, "%d %d %d", &i, &j, &weight) != EOF)
+        dist[i][j] = weight;  // �]�m�����۳s�䪺�v��
+	
+	
+    fclose(fptr);
+    printf("�ɮפ��v���p�U\n");
+	output_step();
+	
+    printf("\n��J�_�l�`�I (1~%d): ", N);
+    scanf("%d", &source);
+    printf("��J�ؼи`�I (1~%d): ", N);
+    scanf("%d", &sink);
+}
+
+bool floydWarshall(){
+    int k, i, j;
+
+    // Floyd Warshall �֤ߺt��k
+    for (k = 1; k <= N; k++) {
+        for (i = 1; i <= N; i++) {
+            for (j = 1; j <= N; j++) {
+                // �p�G�g�L k �I�����|�񪽱����|�u�A��s�Z��
+                if (dist[i][k] != Infinite && 
+                    dist[k][j] != Infinite && 
+                    dist[i][k] + dist[k][j] < dist[i][j]) {
+                    dist[i][j] = dist[i][k] + dist[k][j];
+                }
+            }
+        }
+    }
+    	
+    // �ˬd�O�_�s�b�t�v�j��
+    for (i = 1; i <= N; i++) {
+        if (dist[i][i] < 0) {
+            return true;  // �s�b�t�v�j��
+        }
+    }
+
+    return false;  // ���s�b�t��
+}
+
+
+void output_step(){
+    int i, j;
+
+    // ��X���D�C
+    printf("\t");
+    for (j = 1; j <= N; j++) {
+        printf("V%d\t", j);
+    }
+    printf("\n");
+
+    // ��X�Z���x�}
+    for (i = 1; i <= N; i++) {
+        printf("V%d\t", i);
+        for (j = 1; j <= N; j++) {
+            if (dist[i][j] == Infinite)
+                printf("��\t");
+            else
+                printf("%2ld\t", dist[i][j]);
+        }
+        printf("\n");
+    }
+}
+
+void output_path(){
+    int i, j;
+
+    // ��X���D�C
+    printf("\n�`�I���̵u�Z���x�}�G\n");
+    
+	output_step();
+    
+	// �ˬd�_�I����I�����|
+    if (dist[source][sink] == Infinite) {
+        printf("\n�`�I V%d ��`�I V%d �S�����|\n", source, sink);
+    } else {
+        printf("\n�q�`�I V%d ��`�I V%d ���̵u�Z�����G%ld\n", 
+               source, sink, dist[source][sink]);
+    }
+}
diff --git a/作業/unit12/DS7.exe b/作業/unit12/DS7.exe
new file mode 100644
index 0000000..c71532c
Binary files /dev/null and b/作業/unit12/DS7.exe differ
diff --git a/作業/unit12/DS7.zip b/作業/unit12/DS7.zip
new file mode 100644
index 0000000..b0f7a53
Binary files /dev/null and b/作業/unit12/DS7.zip differ
diff --git a/作業/unit12/DS7/DS7.cpp b/作業/unit12/DS7/DS7.cpp
new file mode 100644
index 0000000..4e19c05
--- /dev/null
+++ b/作業/unit12/DS7/DS7.cpp
@@ -0,0 +1,131 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+#define MAX_V 100   /*�̤j�`�I��*/
+#define Infinite 1073741823
+
+long int dist[MAX_V+1][MAX_V+1];
+int N;  // �`�I�ƶq
+int source, sink;  // �_�I�M���I
+
+void init();
+int floydWarshall();
+void output_path();
+void output_step();
+
+int main() {
+	
+    init();
+    
+    // �ˬd�O�_�s�b�t�v�j��
+    if (floydWarshall()) {
+    	output_path();
+        printf("\n�ϧΤ��s�b�t�v�j���A�L�k�p��̵u���|\n");
+    } else {
+        output_path();
+    }
+    
+    return 0;
+}
+
+void init(){
+    FILE *fptr;
+    int i, j, weight;
+
+    fptr = fopen("shortestPath.dat", "r");
+    if (fptr == NULL) {
+        perror("shortestPath.dat");
+        exit(1);
+    }
+
+    fscanf(fptr, "%d", &N);  // Ū���ϧθ`�I��
+
+    // ��l�ƶZ���x�}
+    for (i = 1; i <= N; i++) {
+        for (j = 1; j <= N; j++) {
+            if (i == j)
+                dist[i][j] = 0;  // �ۨ���ۨ����Z����0
+            else
+                dist[i][j] = Infinite;  // ��L�w�]���L�a�j
+        }
+    }
+	
+    // Ū���䪺�v��
+    while (fscanf(fptr, "%d %d %d", &i, &j, &weight) != EOF)
+        dist[i][j] = weight;  // �]�m�����۳s�䪺�v��
+	
+    fclose(fptr);
+    printf("�ɮפ��v���p�U\n");
+	output_step();
+	
+    printf("\n��J�_�l�`�I (1~%d): ", N);
+    scanf("%d", &source);
+    printf("��J�ؼи`�I (1~%d): ", N);
+    scanf("%d", &sink);
+}
+
+int floydWarshall(){
+    int k, i, j;
+
+    for (k = 1; k <= N; k++) {
+        for (i = 1; i <= N; i++) {
+            for (j = 1; j <= N; j++) {
+                // �p�G�g�L k �I�����|�񪽱����|�u�A��s�Z��
+                if (dist[i][k] != Infinite && 
+                    dist[k][j] != Infinite && 
+                    dist[i][k] + dist[k][j] < dist[i][j]) {
+                    dist[i][j] = dist[i][k] + dist[k][j];
+                }
+            }
+        }
+    }
+    	
+    // �ˬd�O�_�s�b�t�v�j��
+    for (i = 1; i <= N; i++) {
+        if (dist[i][i] < 0) {
+            return 1;  // �s�b�t�v�j��
+        }
+    }
+
+    return 0;  // ���s�b�t�v�j��
+}
+
+
+void output_step(){
+    int i, j;
+
+    printf("\t");
+    for (j = 1; j <= N; j++) {
+        printf("V%d\t", j);
+    }
+    printf("\n");
+
+    // ��X�Z���x�}
+    for (i = 1; i <= N; i++) {
+        printf("V%d\t", i);
+        for (j = 1; j <= N; j++) {
+            if (dist[i][j] == Infinite)
+                printf("��\t");
+            else
+                printf("%2ld\t", dist[i][j]);
+        }
+        printf("\n");
+    }
+}
+
+void output_path(){
+    int i, j;
+
+    // ��X���D�C
+    printf("\n�`�I���̵u�Z���x�}�G\n");
+    
+	output_step();
+    
+	// �ˬd�_�I����I�����|
+    if (dist[source][sink] == Infinite) {
+        printf("\n�`�I V%d ��`�I V%d �S�����|\n", source, sink);
+    } else {
+        printf("\n�q�`�I V%d ��`�I V%d ���̵u�Z�����G%ld\n", 
+               source, sink, dist[source][sink]);
+    }
+}
diff --git a/作業/unit12/DS7/shortestPath.dat b/作業/unit12/DS7/shortestPath.dat
new file mode 100644
index 0000000..fcb6ad8
--- /dev/null
+++ b/作業/unit12/DS7/shortestPath.dat
@@ -0,0 +1,13 @@
+7 
+1 2 4
+1 3 6
+1 4 6
+2 3 1
+2 5 7
+3 5 6
+3 6 4
+4 3 2
+4 6 5
+5 7 6
+6 5 1 
+6 7 8
diff --git a/作業/unit12/DS7/shortestPath_1.dat b/作業/unit12/DS7/shortestPath_1.dat
new file mode 100644
index 0000000..b378f5b
--- /dev/null
+++ b/作業/unit12/DS7/shortestPath_1.dat
@@ -0,0 +1,25 @@
+7 
+1 2 4
+1 3 6
+1 4 6
+2 3 1
+2 5 7
+3 5 6
+3 6 4
+4 3 2
+4 6 5
+5 7 -6
+6 5 1 
+6 7 8
+2 1 4
+3 1 6
+4 1 6
+3 2 1
+3 4 2
+5 2 7
+5 3 6
+5 6 1
+6 4 5
+6 3 4
+7 5 6
+7 6 8
diff --git a/作業/unit12/DS7/shortestPath_2.dat b/作業/unit12/DS7/shortestPath_2.dat
new file mode 100644
index 0000000..24e4e93
--- /dev/null
+++ b/作業/unit12/DS7/shortestPath_2.dat
@@ -0,0 +1,15 @@
+8
+1 2 1
+1 3 3
+2 3 1
+2 5 3
+2 4 5
+3 5 1
+3 6 4
+4 5 3
+4 7 8
+5 6 4
+5 7 7
+6 8 7 
+7 6 6
+7 8 2
diff --git a/作業/unit12/DS7_down.cpp b/作業/unit12/DS7_down.cpp
new file mode 100644
index 0000000..7b14042
--- /dev/null
+++ b/作業/unit12/DS7_down.cpp
@@ -0,0 +1,186 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+
+#define MAX_V 100   /*�̤j�`�I��*/
+#define Infinite 1073741823
+
+long int dist[MAX_V+1][MAX_V+1];
+int path[MAX_V+1][MAX_V+1];  // �l�ܸ��|���x�}
+int N;  // �`�I�ƶq
+int source, sink;  // �_�I�M���I
+
+void init();
+bool floydWarshall();
+void output_path();
+void output_step();
+void print_path(int start, int end);
+
+int main() {
+    init();
+    
+    // �ˬd�O�_�s�b�t�v�j��
+    if (floydWarshall()) {
+        printf("\nĵ�i�G�ϧΤ��s�b�t�v�j���A�p�⵲�G�i�ण���T�I\n");
+        output_path();
+    } else {
+        output_path();
+    }
+    
+    return 0;
+}
+
+void init(){
+    FILE *fptr;
+    int i, j, weight,line_count=0;
+    char line[256];
+
+    fptr = fopen("shortestPath_down_1.dat", "r");
+    if (fptr == NULL) {
+        perror("shortestPath_up_1.dat");
+        exit(1);
+    }
+    
+    // �p���`���I��
+    while (fgets(line, sizeof(line), fptr)) {
+        line_count++;
+    }
+    N = line_count;
+    rewind(fptr);
+
+        // ��l�ƶZ���x�}�P���|�x�}
+    for (i = 1; i <= N; i++) {
+        for (j = 1; j <= N; j++) {
+            if (i == j) {
+                dist[i][j] = 0;
+                path[i][j] = i;
+            } else {
+                dist[i][j] = Infinite;
+                path[i][j] = -1;
+            }
+        }
+    }
+
+    // Ū���U�T���x�}
+    for (i = 1; i <= N; i++) {
+        for (j = 1; j < i; j++) {
+            if (fscanf(fptr, "%d", &weight) == 1) {
+                if (weight != 0) {  // �u�B�z�D�s�v��
+                    dist[i][j] = weight;
+                    path[i][j] = i;
+                    // �]���O�L�V�ϡA�ҥH��٦�m�]�n�]�w
+                    if (i != j) {
+                        dist[j][i] = weight;
+                        path[j][i] = j;
+                    }
+                }
+            }
+        }
+        // ���L�Ӧ�Ѿl���r��
+        fgets(line, sizeof(line), fptr);
+    }
+
+    fclose(fptr);
+    printf("�ɮפ��v���p�U\n");
+    output_step();
+    
+    printf("\n��J�_�l�`�I (1~%d): ", N);
+    scanf("%d", &source);
+    printf("��J�ؼи`�I (1~%d): ", N);
+    scanf("%d", &sink);
+}
+
+bool floydWarshall(){
+    int k, i, j;
+    bool has_negative_cycle = false;
+    long int temp_dist[MAX_V+1][MAX_V+1];
+
+    // �D�n�� Floyd-Warshall �t��k
+    for (k = 1; k <= N; k++) {
+        for (i = 1; i <= N; i++) {
+            for (j = 1; j <= N; j++) {
+                if (dist[i][k] != Infinite && 
+                    dist[k][j] != Infinite && 
+                    dist[i][k] + dist[k][j] < dist[i][j]) {
+                    dist[i][j] = dist[i][k] + dist[k][j];
+                    path[i][j] = path[k][j];
+                }
+            }
+        }
+    }
+
+    // �ƻs�ثe���Z���x�}
+    for (i = 1; i <= N; i++) {
+        for (j = 1; j <= N; j++) {
+            temp_dist[i][j] = dist[i][j];
+        }
+    }
+
+    // �A����@�����N���ˬd�t�v�j��
+    for (k = 1; k <= N; k++) {
+        for (i = 1; i <= N; i++) {
+            for (j = 1; j <= N; j++) {
+                if (dist[i][k] != Infinite && 
+                    dist[k][j] != Infinite && 
+                    dist[i][k] + dist[k][j] < temp_dist[i][j]) {
+                    has_negative_cycle = true;
+                    goto end_check; // ���t�v�j���᪽�����X
+                }
+            }
+        }
+    }
+
+end_check:
+    return has_negative_cycle;
+}
+
+void print_path(int start, int end) {
+    if (start == end) {
+        printf("���I%d", start);
+        return;
+    }
+    if (path[start][end] == -1) {
+        printf("�L���|");
+        return;
+    }
+    print_path(start, path[start][end]);
+    printf(" �� %d", end);
+}
+
+void output_step(){
+    int i, j;
+
+    printf("\t");
+    for (j = 1; j <= N; j++) {
+        printf("V%d\t", j);
+    }
+    printf("\n");
+
+    for (i = 1; i <= N; i++) {
+        printf("V%d\t", i);
+        for (j = 1; j <= N; j++) {
+            if (dist[i][j] == Infinite)
+                printf("��\t");
+            else
+                printf("%2ld\t", dist[i][j]);
+        }
+        printf("\n");
+    }
+}
+
+void output_path(){
+    int i, j;
+
+    printf("\n�`�I���̵u�Z���x�}�G\n");
+    output_step();
+    
+    if (dist[source][sink] == Infinite) {
+        printf("\n�`�I V%d ��`�I V%d �S�����|\n", source, sink);
+    } else {
+        printf("\n�q�`�I V%d ��`�I V%d ���̵u�Z�����G%ld\n", 
+               source, sink, dist[source][sink]);
+        printf("�̵u���|�G");
+        print_path(source, sink);
+        printf("\n");
+    }
+}
diff --git a/作業/unit12/DS7_down.exe b/作業/unit12/DS7_down.exe
new file mode 100644
index 0000000..6a79e2e
Binary files /dev/null and b/作業/unit12/DS7_down.exe differ
diff --git a/作業/unit12/DS7_matrix.cpp b/作業/unit12/DS7_matrix.cpp
new file mode 100644
index 0000000..b1a53be
--- /dev/null
+++ b/作業/unit12/DS7_matrix.cpp
@@ -0,0 +1,179 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+
+#define MAX_V 100   /*�̤j�`�I��*/
+#define Infinite 1073741823
+
+long int dist[MAX_V+1][MAX_V+1];
+int path[MAX_V+1][MAX_V+1];  // �l�ܸ��|���x�}
+int N;  // �`�I�ƶq
+int source, sink;  // �_�I�M���I
+
+void init();
+bool floydWarshall();
+void output_path();
+void output_step();
+void print_path(int start, int end);
+
+int main() {
+    init();
+    
+    // �ˬd�O�_�s�b�t�v�j��
+    if (floydWarshall()) {
+        printf("\nĵ�i�G�ϧΤ��s�b�t�v�j���A�p�⵲�G�i�ण���T�I\n");
+        output_path();
+    } else {
+        output_path();
+    }
+    
+    return 0;
+}
+
+void init() {
+    FILE *fptr;
+    int i, j, weight, line_count = 0;
+    char line[256];
+
+    fptr = fopen("shortestPath_matrix.dat", "r");
+    if (fptr == NULL) {
+        perror("shortestPath_matrix.dat");
+        exit(1);
+    }
+    
+    // �p���`���I��
+    while (fgets(line, sizeof(line), fptr)) {
+        line_count++;
+    }
+    N = line_count;
+    rewind(fptr);
+
+    // ��l�ƶZ���x�}�P���|�x�}
+    for (i = 1; i <= N; i++) {
+        for (j = 1; j <= N; j++) {
+            if (i == j) {
+                dist[i][j] = 0;
+                path[i][j] = i;
+            } else {
+                dist[i][j] = Infinite;
+                path[i][j] = -1;
+            }
+        }
+    }
+
+    // Ū������x�}
+    for (i = 1; i <= N; i++) {
+        for (j = 1; j <= N; j++) {
+            if (fscanf(fptr, "%d", &weight) == 1) {
+                if (weight != 0 && i != j) {  // �u�B�z�D�s�B�D�﨤�u���v��
+                    dist[i][j] = weight;
+                    path[i][j] = i;
+                }
+            }
+        }
+    }
+
+    fclose(fptr);
+    printf("�ɮפ��v���p�U\n");
+    output_step();
+    
+    printf("\n��J�_�l�`�I (1~%d): ", N);
+    scanf("%d", &source);
+    printf("��J�ؼи`�I (1~%d): ", N);
+    scanf("%d", &sink);
+}
+
+bool floydWarshall(){
+    int k, i, j;
+    bool has_negative_cycle = false;
+    long int temp_dist[MAX_V+1][MAX_V+1];
+
+    // �D�n�� Floyd-Warshall �t��k
+    for (k = 1; k <= N; k++) {
+        for (i = 1; i <= N; i++) {
+            for (j = 1; j <= N; j++) {
+                if (dist[i][k] != Infinite && 
+                    dist[k][j] != Infinite && 
+                    dist[i][k] + dist[k][j] < dist[i][j]) {
+                    dist[i][j] = dist[i][k] + dist[k][j];
+                    path[i][j] = path[k][j];
+                }
+            }
+        }
+    }
+
+    // �ƻs�ثe���Z���x�}
+    for (i = 1; i <= N; i++) {
+        for (j = 1; j <= N; j++) {
+            temp_dist[i][j] = dist[i][j];
+        }
+    }
+
+    // �A����@�����N���ˬd�t�v�j��
+    for (k = 1; k <= N; k++) {
+        for (i = 1; i <= N; i++) {
+            for (j = 1; j <= N; j++) {
+                if (dist[i][k] != Infinite && 
+                    dist[k][j] != Infinite && 
+                    dist[i][k] + dist[k][j] < temp_dist[i][j]) {
+                    has_negative_cycle = true;
+                    goto end_check; // ���t�v�j���᪽�����X
+                }
+            }
+        }
+    }
+
+end_check:
+    return has_negative_cycle;
+}
+
+void print_path(int start, int end) {
+    if (start == end) {
+        printf("���I%d", start);
+        return;
+    }
+    if (path[start][end] == -1) {
+        printf("�L���|");
+        return;
+    }
+    print_path(start, path[start][end]);
+    printf(" �� %d", end);
+}
+
+void output_step(){
+    int i, j;
+
+    printf("\t");
+    for (j = 1; j <= N; j++) {
+        printf("V%d\t", j);
+    }
+    printf("\n");
+
+    for (i = 1; i <= N; i++) {
+        printf("V%d\t", i);
+        for (j = 1; j <= N; j++) {
+            if (dist[i][j] == Infinite)
+                printf("��\t");
+            else
+                printf("%2ld\t", dist[i][j]);
+        }
+        printf("\n");
+    }
+}
+
+void output_path(){
+    int i, j;
+
+    printf("\n�`�I���̵u�Z���x�}�G\n");
+    output_step();
+    
+    if (dist[source][sink] == Infinite) {
+        printf("\n�`�I V%d ��`�I V%d �S�����|\n", source, sink);
+    } else {
+        printf("\n�q�`�I V%d ��`�I V%d ���̵u�Z�����G%ld\n", 
+               source, sink, dist[source][sink]);
+        printf("�̵u���|�G");
+        print_path(source, sink);
+        printf("\n");
+    }
+}
diff --git a/作業/unit12/DS7_matrix.exe b/作業/unit12/DS7_matrix.exe
new file mode 100644
index 0000000..49dddb6
Binary files /dev/null and b/作業/unit12/DS7_matrix.exe differ
diff --git a/作業/unit12/DS7_new.cpp b/作業/unit12/DS7_new.cpp
new file mode 100644
index 0000000..3a64f14
--- /dev/null
+++ b/作業/unit12/DS7_new.cpp
@@ -0,0 +1,167 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+
+#define MAX_V 100   /*�̤j�`�I��*/
+#define Infinite 1073741823
+
+long int dist[MAX_V+1][MAX_V+1];
+int path[MAX_V+1][MAX_V+1];  // �l�ܸ��|���x�}
+int N;  // �`�I�ƶq
+int source, sink;  // �_�I�M���I
+
+void init();
+bool floydWarshall();
+void output_path();
+void output_step();
+void print_path(int start, int end);
+
+int main() {
+    init();
+    
+    // �ˬd�O�_�s�b�t�v�j��
+    if (floydWarshall()) {
+        printf("\nĵ�i�G�ϧΤ��s�b�t�v�j���A�p�⵲�G�i�ण���T�I\n");
+        output_step();
+//        output_path();
+    } else {
+        output_path();
+    }
+    
+    return 0;
+}
+
+void init(){
+    FILE *fptr;
+    int i, j, weight;
+
+    fptr = fopen("shortestPath.dat", "r");
+    if (fptr == NULL) {
+        perror("shortestPath.dat");
+        exit(1);
+    }
+
+    fscanf(fptr, "%d", &N);  // Ū���ϧθ`�I��
+
+    // ��l�ƶZ���x�}�P���|�x�}
+    for (i = 1; i <= N; i++) {
+        for (j = 1; j <= N; j++) {
+            if (i == j) {
+                dist[i][j] = 0;
+                path[i][j] = i;
+            } else {
+                dist[i][j] = Infinite;
+                path[i][j] = -1;
+            }
+        }
+    }
+    
+    while (fscanf(fptr, "%d %d %d", &i, &j, &weight) != EOF) {
+        dist[i][j] = weight;
+        path[i][j] = i;
+    }
+    
+    fclose(fptr);
+    printf("�ɮפ��v���p�U\n");
+    output_step();
+    
+    printf("\n��J�_�l�`�I (1~%d): ", N);
+    scanf("%d", &source);
+    printf("��J�ؼи`�I (1~%d): ", N);
+    scanf("%d", &sink);
+}
+
+bool floydWarshall(){
+    int k, i, j;
+    bool has_negative_cycle = false;
+    long int temp_dist[MAX_V+1][MAX_V+1];
+
+    // �D�n�� Floyd-Warshall �t��k
+    for (k = 1; k <= N; k++) {
+        for (i = 1; i <= N; i++) {
+            for (j = 1; j <= N; j++) {
+                if (dist[i][k] != Infinite && 
+                    dist[k][j] != Infinite && 
+                    dist[i][k] + dist[k][j] < dist[i][j]) {
+                    dist[i][j] = dist[i][k] + dist[k][j];
+                    path[i][j] = path[k][j];
+                }
+            }
+        }
+    }
+
+    // �ƻs�ثe���Z���x�}
+    for (i = 1; i <= N; i++) {
+        for (j = 1; j <= N; j++) {
+            temp_dist[i][j] = dist[i][j];
+        }
+    }
+
+    // �A����@�����N���ˬd�t�v�j��
+    for (k = 1; k <= N; k++) {
+        for (i = 1; i <= N; i++) {
+            for (j = 1; j <= N; j++) {
+                if (dist[i][k] != Infinite && 
+                    dist[k][j] != Infinite && 
+                    dist[i][k] + dist[k][j] < temp_dist[i][j]) {
+                    has_negative_cycle = true;
+                    goto end_check; // ���t�v�j���᪽�����X
+                }
+            }
+        }
+    }
+
+end_check:
+    return has_negative_cycle;
+}
+
+void print_path(int start, int end) {
+    if (start == end) {
+        printf("���I%d", start);
+        return;
+    }
+    if (path[start][end] == -1) {
+        printf("�L���|");
+        return;
+    }
+    print_path(start, path[start][end]);
+    printf(" �� %d", end);
+}
+
+void output_step(){
+    int i, j;
+
+    printf("\t");
+    for (j = 1; j <= N; j++) {
+        printf("V%d\t", j);
+    }
+    printf("\n");
+
+    for (i = 1; i <= N; i++) {
+        printf("V%d\t", i);
+        for (j = 1; j <= N; j++) {
+            if (dist[i][j] == Infinite)
+                printf("��\t");
+            else
+                printf("%2ld\t", dist[i][j]);
+        }
+        printf("\n");
+    }
+}
+
+void output_path(){
+    int i, j;
+
+    printf("\n�`�I���̵u�Z���x�}�G\n");
+    output_step();
+    
+    if (dist[source][sink] == Infinite) {
+        printf("\n�`�I V%d ��`�I V%d �S�����|\n", source, sink);
+    } else {
+        printf("\n�q�`�I V%d ��`�I V%d ���̵u�Z�����G%ld\n", 
+               source, sink, dist[source][sink]);
+        printf("�̵u���|�G");
+        print_path(source, sink);
+        printf("\n");
+    }
+}
diff --git a/作業/unit12/DS7_new.exe b/作業/unit12/DS7_new.exe
new file mode 100644
index 0000000..5eb2ee3
Binary files /dev/null and b/作業/unit12/DS7_new.exe differ
diff --git a/作業/unit12/DS7_up.cpp b/作業/unit12/DS7_up.cpp
new file mode 100644
index 0000000..0b252b6
--- /dev/null
+++ b/作業/unit12/DS7_up.cpp
@@ -0,0 +1,186 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+
+#define MAX_V 100   /*�̤j�`�I��*/
+#define Infinite 1073741823
+
+long int dist[MAX_V+1][MAX_V+1];
+int path[MAX_V+1][MAX_V+1];  // �l�ܸ��|���x�}
+int N;  // �`�I�ƶq
+int source, sink;  // �_�I�M���I
+
+void init();
+bool floydWarshall();
+void output_path();
+void output_step();
+void print_path(int start, int end);
+
+int main() {
+    init();
+    
+    // �ˬd�O�_�s�b�t�v�j��
+    if (floydWarshall()) {
+        printf("\nĵ�i�G�ϧΤ��s�b�t�v�j���A�p�⵲�G�i�ण���T�I\n");
+        output_path();
+    } else {
+        output_path();
+    }
+    
+    return 0;
+}
+
+void init(){
+    FILE *fptr;
+    int i, j, weight,line_count=0;
+    char line[256];
+
+    fptr = fopen("shortestPath_up_1.dat", "r");
+    if (fptr == NULL) {
+        perror("shortestPath_up_1.dat");
+        exit(1);
+    }
+    
+    // �p���`���I��
+    while (fgets(line, sizeof(line), fptr)) {
+        line_count++;
+    }
+    N = line_count;
+    rewind(fptr);
+
+        // ��l�ƶZ���x�}�P���|�x�}
+    for (i = 1; i <= N; i++) {
+        for (j = 1; j <= N; j++) {
+            if (i == j) {
+                dist[i][j] = 0;
+                path[i][j] = i;
+            } else {
+                dist[i][j] = Infinite;
+                path[i][j] = -1;
+            }
+        }
+    }
+
+    // Ū���W�T���x�}
+    for (i = 1; i <= N; i++) {
+        for (j = i; j <= N; j++) {
+            if (fscanf(fptr, "%d", &weight) == 1) {
+                if (weight != 0) {  // �u�B�z�D�s�v��
+                    dist[i][j] = weight;
+                    path[i][j] = i;
+                    // �]���O�L�V�ϡA�ҥH��٦�m�]�n�]�w
+                    if (i != j) {
+                        dist[j][i] = weight;
+                        path[j][i] = j;
+                    }
+                }
+            }
+        }
+        // ���L�Ӧ�Ѿl���r��
+        fgets(line, sizeof(line), fptr);
+    }
+
+    fclose(fptr);
+    printf("�ɮפ��v���p�U\n");
+    output_step();
+    
+    printf("\n��J�_�l�`�I (1~%d): ", N);
+    scanf("%d", &source);
+    printf("��J�ؼи`�I (1~%d): ", N);
+    scanf("%d", &sink);
+}
+
+bool floydWarshall(){
+    int k, i, j;
+    bool has_negative_cycle = false;
+    long int temp_dist[MAX_V+1][MAX_V+1];
+
+    // �D�n�� Floyd-Warshall �t��k
+    for (k = 1; k <= N; k++) {
+        for (i = 1; i <= N; i++) {
+            for (j = 1; j <= N; j++) {
+                if (dist[i][k] != Infinite && 
+                    dist[k][j] != Infinite && 
+                    dist[i][k] + dist[k][j] < dist[i][j]) {
+                    dist[i][j] = dist[i][k] + dist[k][j];
+                    path[i][j] = path[k][j];
+                }
+            }
+        }
+    }
+
+    // �ƻs�ثe���Z���x�}
+    for (i = 1; i <= N; i++) {
+        for (j = 1; j <= N; j++) {
+            temp_dist[i][j] = dist[i][j];
+        }
+    }
+
+    // �A����@�����N���ˬd�t�v�j��
+    for (k = 1; k <= N; k++) {
+        for (i = 1; i <= N; i++) {
+            for (j = 1; j <= N; j++) {
+                if (dist[i][k] != Infinite && 
+                    dist[k][j] != Infinite && 
+                    dist[i][k] + dist[k][j] < temp_dist[i][j]) {
+                    has_negative_cycle = true;
+                    goto end_check; // ���t�v�j���᪽�����X
+                }
+            }
+        }
+    }
+
+end_check:
+    return has_negative_cycle;
+}
+
+void print_path(int start, int end) {
+    if (start == end) {
+        printf("���I%d", start);
+        return;
+    }
+    if (path[start][end] == -1) {
+        printf("�L���|");
+        return;
+    }
+    print_path(start, path[start][end]);
+    printf(" �� %d", end);
+}
+
+void output_step(){
+    int i, j;
+
+    printf("\t");
+    for (j = 1; j <= N; j++) {
+        printf("V%d\t", j);
+    }
+    printf("\n");
+
+    for (i = 1; i <= N; i++) {
+        printf("V%d\t", i);
+        for (j = 1; j <= N; j++) {
+            if (dist[i][j] == Infinite)
+                printf("��\t");
+            else
+                printf("%2ld\t", dist[i][j]);
+        }
+        printf("\n");
+    }
+}
+
+void output_path(){
+    int i, j;
+
+    printf("\n�`�I���̵u�Z���x�}�G\n");
+    output_step();
+    
+    if (dist[source][sink] == Infinite) {
+        printf("\n�`�I V%d ��`�I V%d �S�����|\n", source, sink);
+    } else {
+        printf("\n�q�`�I V%d ��`�I V%d ���̵u�Z�����G%ld\n", 
+               source, sink, dist[source][sink]);
+        printf("�̵u���|�G");
+        print_path(source, sink);
+        printf("\n");
+    }
+}
diff --git a/作業/unit12/DS7_up.exe b/作業/unit12/DS7_up.exe
new file mode 100644
index 0000000..78a4748
Binary files /dev/null and b/作業/unit12/DS7_up.exe differ
diff --git a/作業/unit12/all-pairs-shortest-path-v1.c b/作業/unit12/all-pairs-shortest-path-v1.c
deleted file mode 100644
index 57e7ccd..0000000
--- a/作業/unit12/all-pairs-shortest-path-v1.c
+++ /dev/null
@@ -1,135 +0,0 @@
-/*
-Program: all-pairs-shortest-path-v1.c (Report comments/bugs to chikh@yuntech.edu.tw)
-Function: ��@Floyd-Warshall�t��k�A�H�Ѫ���shortestPath.dat�ɮק@����J 
-Notes: 
-	1) Floyd-Warshall�t��k���u�ʺA�W���v(dynamic programming)�k
-	2) Ū����Ʃҥε{���X���ۮѪ���shortestPath.c���վ�禡���쫬(prototype)�B�ץΥ����ܼ� 
-	3) �����Ѧ� https://www.geeksforgeeks.org/floyd-warshall-algorithm-dp-16/
-	   �P https://www.programiz.com/dsa/floyd-warshall-algorithm 
-*/
-
-#include <stdio.h>
-#include <stdlib.h>	/* for exit() */
-
-#define MAX_V 		100			/* �̤j���I�� */
-#define Inf 		1073741823	/* ����2^30-1���j�Ʀr�A�����{�����]���L���j�ȡF�i���limits.h�w�q��INT_MAX */
-
-void init(int A[][MAX_V], int Y[][MAX_V], int *N)	/* Ū����J����ɡB�]�w�۾F�x�}�A�������Ƶ��c�@��l�� */ 
-{
-    FILE *fptr;
-    int  i, j;
-    int  weight;
-
-    if ((fptr=fopen("shortestPath.dat","r")) == NULL) {	/* �}�Ҹ���� */ 
-        perror("shortestPath.dat");
-        exit(1);
-    }
-
-    fscanf(fptr,"%d",N);		/* Ū���ϧθ`�I�� */
-    for (i = 1; i <= *N; i++ )
-        for (j = 1; j <= *N; j++) {
-            A[i][j] = (i==j)? 0: Inf;	/* ��l��A[1..N][1..N]�۾F�x�}�A�Ҧ����������w�]���� */
-            Y[i][j] = (i==j)? i: -1;
-       	}
- 
-    while (fscanf(fptr,"%d %d %d",&i,&j,&weight) != EOF) { 
-    	A[i][j] = weight;	/* Ū���s�����Ii�Pj���䪺�v���� */
-    	Y[i][j] = i;		/* Y[i][j]�w�]��i */ 
-    } 
-    
-	fclose(fptr);
-}
-
-/* ���UfloydWarshall()�禡�N�C�G���I(i,j)�����p��̵u�Z���ȡA�ðO���i�g�ѭ��Ǥ��~���I�F��̵u */ 
-void floydWarshall(int A[][MAX_V], int Y[][MAX_V], int N) 
-{
-	int i, j, k;
-
-	for (k = 1; k <= N; k++) 
-    	for (i = 1; i < N; i++) 
-      		for (j = 1; j <= N; j++) 
-        		if (A[i][k] + A[k][j] < A[i][j]) { //if (A[i][k] != Inf && A[k][j] != Inf && A[i][k] + A[k][j] < A[i][j]) { 	
-        			A[i][j] = A[i][k] + A[k][j];
-					Y[i][j] = Y[k][j]; /* ���g�� Y[i][j] = k */
-				}
-	/* �W���G�hfor�j��Ω�ץ��C�G���I(i,j)�������Z���ȡA�˵����_�g��k(���@�ӥi�઺���~�I)��o���p�Z���� */ 
-	/* 
-	�d�Nline 53���g�k�A���g�� Y[i][j] = k�A�P�ǥi�Ϥ�����t�O��?! 
-	�z�ѡG��line 37�i���A�Y�G���I(i,j)��������s�b�A�N��Y[i][j]�w�]��i�C
-	�]���A�bline 53���A�Yk�Pj����s�b�A�g��Y[k][j]�P�g��k���N�q�ۦP�A�N����j���e�����~�I��k�C 
-	���Yk�Pj�����L��������s���A�h�]Y[i][j] = Y[k][j]�A�N��i��j���̫�@�Ӥ��~�I�N�ѱqk��j�����|�ҰO�����̫� 
-	�@�Ӥ��~�I�M�w(Y[k][j]�����ثe�Ҫ�k��j�Z��j�̪񪺤��~�I)�C 
-	�z�Lline 53�]�mY�x�}���e�A�N�i�^���o��̵u���|  
-	*/	
-}
-
-void printMatrix(int A[][MAX_V], int N) 
-{
-	int i, j;
-	
-	printf("\n\n�B���o���I(i,j)�����x�}��T�p�U�G\n       ");
-	for (i = 1; i <= N; i++) printf("%4d",i);
-	for (i = 0; i <= N; i++) printf("%4s",i==0? "\n      +":"----");
-		
-  	for (i = 1; i <= N; i++) {
-  		printf("\n���I%d |",i);
-    	for (j = 1; j <= N; j++) {
-      		if (A[i][j] == Inf)
-        		printf("%5s","��");	/* somewhat weird to use %5s instead of %4s here */
-      		else
-        		printf("%4d",A[i][j]);
-    	}
-    	//printf("\n");
-  	}
-}
-
-int backtrack(int A[][MAX_V], int Y[][MAX_V], int source, int dest) 
-{
-	int distance, k = Y[source][dest];	/* k��source��dest���������~���I */ 
-	
-	if (source == dest) {
-		printf("���I%d ��",source);
-		return A[source][dest];
-	}
-	if (Y[source][dest] == -1) {
-        printf("���I%d�P%d�����S�����|�s�b:(  ",source,dest);
-        return Inf;
-    }
-    distance = backtrack(A,Y,source,k);
-    printf(" %d ��",dest);
-    
-	return distance+A[k][dest];
-}
-
-void traverseMatrix(int A[][MAX_V],int Y[][MAX_V]) 
-{
-	int distance, source, sink; 
-	
-	printf("\n\n�d�ߥ��G�I�������̵u���|\n���I(0�h�X�d��) => ");
-    scanf("%d",&source);
-    if (source == 0) return;
-    printf("���I(0�h�X�d��) => ");
-    scanf("%d",&sink);
-    if (sink == 0) return;
-	
-	printf("�̵u���|�G");
-	distance = backtrack(A,Y,source,sink);
-	printf("\b\b (�Ҹg����Z���`�M=%d)(�d��A[%d][%d]=%d)",distance,source,sink,A[source][sink]);	/* �ٰ��̫���ܦh�l��"��" */ 
-}
-
-int main() 
-{
-	int N, A[MAX_V][MAX_V], Y[MAX_V][MAX_V] = {0};
-	/* N���ϩҧt�����I����`�ơFA[1..N][1..N]���ϧΪ��۾F�x�} */
-	/* Y[1..N][1..N]�O�����G���I(i,j)�����Zj�̪񪺤��~�I�A�N�Ω�̵u���|�^������ */
-	
-	printf("\n*** �� all-pairs shortest-path ���D ***");
-            
-	init(A,Y,&N);			/* Ū����J����ɡB�]�w�۾F�x�}�A�ç������Ƶ��c�@��l�� */
-  	floydWarshall(A,Y,N);
-  	printMatrix(A,N);
-  	//printMatrix(Y,N);
-  	traverseMatrix(A,Y);
-	
-	return 0; 
-}
diff --git a/作業/unit12/all-pairs-shortest-path-v2.c b/作業/unit12/all-pairs-shortest-path-v2.c
deleted file mode 100644
index 47f40d3..0000000
--- a/作業/unit12/all-pairs-shortest-path-v2.c
+++ /dev/null
@@ -1,130 +0,0 @@
-/*
-Program: all-pairs-shortest-path-v2.c (Report comments/bugs to chikh@yuntech.edu.tw)
-Function: �ק�all-pairs-shortest-path-v1.c�ϱoA�PY�x�}��̹Ϥ������I�`�Ƨ@�t�m�A�קK
-		�w���t�m�L�j��100x100�}�C�Ŷ��ӧΦ����O 
-*/
-
-#include <stdio.h>
-#include <stdlib.h>	/* for exit() */
-
-#define Inf 		1073741823	/* ����2^30-1���j�Ʀr�A�����{�����]���L���j�ȡF�i���limits.h�w�q��INT_MAX */
-
-void init(int ***A, int ***Y)	/* Ū����J����ɡB�]�w�۾F�x�}�A�������Ƶ��c�@��l�� */ 
-{
-    FILE *fptr;
-    int  i, j;
-    int  weight, N;
-
-    if ((fptr=fopen("shortestPath.dat","r")) == NULL) {	/* �}�Ҹ���� */
-        perror("shortestPath.dat");
-        exit(1);
-    }
-
-    fscanf(fptr,"%d",&N);		/* Ū���ϧθ`�I�� */
-    
-    *A = (int **)malloc((N+1)*sizeof(int *));
-    *Y = (int **)malloc((N+1)*sizeof(int *));
-    for (i = 0; i <= N; i++) {
-        (*A)[i] = (int *)malloc((N+1)*sizeof(int));
-        (*Y)[i] = (int *)malloc((N+1)*sizeof(int));
-    }
-	
-    (*A)[0][0] = N;
-    for (i = 1; i <= N; i++ )
-        for (j = 1; j <= N; j++) {
-			(*A)[i][j] = (i==j)? 0: Inf;	/* ��l��A[1..N][1..N]�۾F�x�}�A�Ҧ����������w�]���� */
-            (*Y)[i][j] = (i==j)? i: -1; 
-        } 
- 
-    while (fscanf(fptr,"%d %d %d",&i,&j,&weight) != EOF) { 
-    	(*A)[i][j] = weight;       /* Ū���s�����Ii�Pj���䪺�v���� */
-    	(*Y)[i][j] = i;
-    }
-	 
-	fclose(fptr);
-}
-
-void floydWarshall(int ***A, int ***Y) 
-{
-	int i, j, k;
-	int N = (*A)[0][0]; //�L�k�ϥ�sizeof(A[0])/sizeof(A[0][0])�PŪ���סA�]�Hmalloc()�t�m�ұo�O����Ŷ����㵲�c 
-
-	for (k = 1; k <= N; k++) 
-    	for (i = 1; i <= N; i++) 
-      		for (j = 1; j <= N; j++) 
-        		if ((*A)[i][k] + (*A)[k][j] < (*A)[i][j]) {
-					(*A)[i][j] = (*A)[i][k] + (*A)[k][j];
-					(*Y)[i][j] = (*Y)[k][j];
-				} 
-		//�W���G�hfor�j��Ω��˵�/�ץ��C�G���I(i,j)�������_�g��k(���~���I)��o��p�Z���� 	
-}
-
-void printMatrix(int **A) 
-{
-	int i, j;
-	int N = A[0][0]; 
-	
-  	for (i = 1; i <= N; i++) {
-    	for (j = 1; j <= N; j++) {
-      		if (A[i][j] == Inf)
-        		printf("%5s","��");
-      		else
-        		printf("%4d",A[i][j]);
-    	}
-    	printf("\n");
-  	}
-}
-
-void backtrack(int **Y, int source, int dest) 
-{
-	int k = Y[source][dest];
-	
-	if (source == dest) {
-		printf("���I%d ��",source);
-		return;
-	}
-	if (Y[source][dest] == -1) {
-        printf("���I%d�P%d�����S�����|�s�b  ",source,dest);
-        return;
-    }
-    backtrack(Y,source,k);
-    printf(" %d ��",dest);
-}
-
-void traverseMatrix(int **Y) 
-{
-	int i, j, k, source, sink; 
-	
-	printf("\n���I => ");
-    scanf("%d",&source);
-    printf("���I => ");
-    scanf("%d",&sink);
-	
-	printf("�̵u���|�G");
-	backtrack(Y,source,sink);
-	printf("\b\b  ");
-}
-
-void freeMemory(int **A, int **Y) 
-{
-	int i, N = A[0][0];
-	
-	for (i = 0; i <= N; i++) { 
-		free(A[i]); 
-		free(Y[i]); 
-	} 
-	free(A); 
-	free(Y);
-}
-
-int main() {
-	int **A, **Y;
-            
-	init(&A,&Y);			/* Ū����J����ɡB�]�w�۾F�x�}�A�ç������Ƶ��c�@��l�� */
-	floydWarshall(&A,&Y);
-  	printMatrix(A);
-  	traverseMatrix(Y);
-  	freeMemory(A,Y);
-  	
-  	return 0;
-}
diff --git a/作業/unit12/all-pairs-shortest-path-v3.c b/作業/unit12/all-pairs-shortest-path-v3.c
deleted file mode 100644
index d8e9da6..0000000
--- a/作業/unit12/all-pairs-shortest-path-v3.c
+++ /dev/null
@@ -1,142 +0,0 @@
-/*
-Program: all-pairs-shortest-path-v3.c (Report comments/bugs to chikh@yuntech.edu.tw)
-Function: �ק�all-pairs-shortest-path-v2.c�A�s�W�ۭqadjMatrix��ƫ��A���tA�PY�G�x�}�A
-		�x�}��̹Ϥ������I�`�Ƨ@�t�m�A�B�קK�ϥΤT�h���СA��P�Ǫ��Dz߭t�� 
-*/
-
-#include <stdio.h>
-#include <stdlib.h>	/* for exit() */
-
-#define Inf 		1073741823	/* ����2^30-1���j�Ʀr�A�����{�����]���L���j�ȡF�i���limits.h�w�q��INT_MAX */
-
-typedef struct adjMatrix {
-	int **A;	/* ��A[][]�x�}�A��H�������й�@ */ 
-	int **Y;	/* ��Y[][]�x�}�A��H�������й�@ */ 
-	int size;	/* �x�}���סA�ΥH���ܤW�z�G�x�}�N�� NxN ��} */ 
-} adjMatrix;
-
-adjMatrix init()	/* Ū����J����ɡB�]�w�۾F�x�}�A�������Ƶ��c�@��l�� */ 
-{
-    FILE *fptr;
-    int  i, j;
-    int  weight, N;
-    static adjMatrix adj;
-
-    if ((fptr=fopen("shortestPath.dat","r")) == NULL) {	/* �}�Ҹ���� */
-        perror("shortestPath.dat");
-        exit(1);
-    }
-
-    fscanf(fptr,"%d",&N);		/* Ū���ϧθ`�I�� */
-    
-    adj.A = (int **)malloc((N+1)*sizeof(int *));
-    adj.Y = (int **)malloc((N+1)*sizeof(int *));
-    for (i = 0; i <= N; i++) {
-        adj.A[i] = (int *)malloc((N+1)*sizeof(int));
-        adj.Y[i] = (int *)malloc((N+1)*sizeof(int));
-    }
-	
-    adj.size = N;
-    for (i = 1; i <= N; i++ )
-        for (j = 1; j <= N; j++) {
-			adj.A[i][j] = (i==j)? 0: Inf;	/* ��l��A[1..N][1..N]�۾F�x�}�A�Ҧ����������w�]���� */
-            adj.Y[i][j] = (i==j)? i: -1; 
-        } 
-	
-    while (fscanf(fptr,"%d %d %d",&i,&j,&weight) != EOF) {
-    	adj.A[i][j] = weight;       /* Ū���s�����Ii�Pj���䪺�v���� */
-    	adj.Y[i][j] = i;
-	}
-    	
-	fclose(fptr);
-	
-	return adj;
-}
-
-void floydWarshall(adjMatrix *adj) {
-	int i, j, k;
-	int N = adj->size; 
-
-	for (k = 1; k <= N; k++) 
-    	for (i = 1; i <= N; i++) 
-      		for (j = 1; j <= N; j++) 
-        		if (adj->A[i][k] + adj->A[k][j] < adj->A[i][j]) {
-        			adj->A[i][j] = adj->A[i][k] +adj->A[k][j];
-        			adj->Y[i][j] = adj->Y[k][j];
-				} 	
-}
-
-void printMatrix(adjMatrix *adj) 
-{
-	int i, j, N = adj->size;
-	
-	printf("\n\n�B���o���I(i,j)�����x�}��T�p�U�G\n       ");
-	for (i = 1; i <= N; i++) printf("%4d",i);
-	for (i = 0; i <= N; i++) printf("%4s",i==0? "\n      +":"----");
-		
-  	for (i = 1; i <= N; i++) {
-  		printf("\n���I%d |",i);
-    	for (j = 1; j <= N; j++) {
-      		if (adj->A[i][j] == Inf)
-        		printf("%5s","��");	/* somewhat weird to use %5s instead of %4s here */
-      		else
-        		printf("%4d",adj->A[i][j]);
-    	}
-    	//printf("\n");
-  	}
-}
-
-void backtrack(adjMatrix *adj, int source, int dest) 
-{
-	int k = adj->Y[source][dest];
-	
-	if (source == dest) {
-		printf("���I%d ��",source);
-		return;
-	}
-	if (adj->Y[source][dest] == -1) {
-        printf("���I%d�P%d�����S�����|�s�b  ",source,dest);
-        return;
-    }
-    backtrack(adj,source,k);
-    printf(" %d ��",dest);
-}
-
-void traverseMatrix(adjMatrix *adj) {
-	int source, sink; 
-	
-	printf("\n\n�d�ߥ��G�I�������̵u���|\n���I(0�h�X�d��) => ");
-    scanf("%d",&source);
-    if (source == 0) return;
-    printf("���I(0�h�X�d��) => ");
-    scanf("%d",&sink);
-    if (sink == 0) return;
-	
-	printf("�̵u���|�G");
-	backtrack(adj,source,sink);
-	printf("\b\b  ");
-}
-
-void freeMemory(adjMatrix *adj) {
-	int i, N = adj->size;
-	
-	for (i = 0; i <= N; i++) { 
-		free(adj->A[i]); 
-		free(adj->Y[i]); 
-	} 
-	free(adj->A); 
-	free(adj->Y);
-}
-
-int main() 
-{
-	printf("\n*** �� all-pairs shortest-path ���D ***");
-	
-	adjMatrix adj = init();			/* Ū����J����ɡB�]�w�۾F�x�}�A�ç������Ƶ��c�@��l�� */
-  	floydWarshall(&adj);
-  	printMatrix(&adj);
-  	traverseMatrix(&adj);
-  	freeMemory(&adj);
-  	
-  	return 0; 
-}
diff --git a/作業/unit12/bfs/bfs.cpp b/作業/unit12/bfs/bfs.cpp
new file mode 100644
index 0000000..2a6b95a
--- /dev/null
+++ b/作業/unit12/bfs/bfs.cpp
@@ -0,0 +1,161 @@
+/* �ϧΪ��l��: �۾F��C�P�s���u���j�M�k(BFS)*/
+#include <stdio.h>
+#include <stdlib.h>
+#define MAX_V 100  /*�̤j�`�I��*/
+#define TRUE 1
+#define FALSE 0
+
+/*�w�q��Ƶ��c*/
+typedef struct node_tag {
+    int vertex;
+    struct node_tag *link;
+} Node;
+
+/*�w�q��C���c*/
+typedef struct {
+    int items[MAX_V];
+    int front;
+    int rear;
+} Queue;
+
+Node *adjlist[MAX_V+1];  /*�ŧi�۾F��C*/
+int visited[MAX_V+1];    /*�O�����I�O�_�w���X*/
+int total_vertex;
+
+void build_adjlist(void);
+void show_adjlist(void);
+void bfs(int);
+Node *searchlast(Node *);
+
+/*��C�ާ@���*/
+Queue* createQueue() {
+    Queue *q = (Queue*)malloc(sizeof(Queue));
+    q->front = -1;
+    q->rear = -1;
+    return q;
+}
+
+int isEmpty(Queue* q) {
+    return q->front == -1;
+}
+
+void enqueue(Queue* q, int value) {
+    if(q->front == -1)
+        q->front = 0;
+    q->rear++;
+    q->items[q->rear] = value;
+}
+
+int dequeue(Queue* q) {
+    int item = q->items[q->front];
+    if(q->front == q->rear) {
+        q->front = -1;
+        q->rear = -1;
+    } else {
+        q->front++;
+    }
+    return item;
+}
+
+int main()
+{
+    build_adjlist(); /*�H�۾F��C���ܹϧ�*/
+    show_adjlist();  /*��ܦ�C�����*/
+    puts("\n------Breadth First Search------");
+    bfs(1);          /*�ϧΤ��s���u���j�M�A�H���I1���ҩl���I*/
+    printf("\n");
+    return 0;
+}
+
+void build_adjlist()
+{
+    FILE *fptr;
+    Node *node,*lastnode;
+    int vi,vj ,weight;
+    fptr = fopen("dfs_1.dat", "r");
+    if (fptr == NULL) {
+        perror("dfs.dat");
+        exit(0);
+    }
+    /* Ū���`�I�`�� */
+    fscanf(fptr, "%d", &total_vertex);
+    for (vi = 1; vi <= total_vertex; vi++) {
+        /*�]�w�}�C�ΦU��C�ҩl��*/
+        visited[vi] = FALSE;
+        adjlist[vi] = (Node *)malloc(sizeof(Node));
+        adjlist[vi]->vertex = vi;
+        adjlist[vi]->link = NULL;
+    }
+    /* Ū���`�I��� */
+    for (vi = 1; vi <= total_vertex; vi++)
+        for (vj = 1; vj <= total_vertex; vj++) {
+            fscanf(fptr,"%d",&weight);
+            /* ����ɥH�۾F�x�}�榡�x�s,�H1�N���۾F
+               0 �N�����۾F�A�N�۾F���I�쵲�b�U��C�� */
+            if (weight != 0) {
+                node = (Node *)malloc(sizeof(Node));
+                node->vertex = vj;
+                node->link = NULL;
+                lastnode = searchlast(adjlist[vi]);
+                lastnode->link = node;
+            }
+        }
+    fclose(fptr);
+}
+
+/*��ܦU�۾F��C�����*/
+void show_adjlist()
+{
+    int index;
+    Node *ptr;
+    puts("Head    adjacency nodes");
+    puts("------------------------------");
+    for (index = 1; index <= total_vertex; index++) {
+        printf("V%-2d ",adjlist[index]->vertex);
+        ptr = adjlist[index]->link;
+        while (ptr != NULL) {
+            printf("--> V%d ",ptr->vertex);
+            ptr = ptr->link;
+        }
+        printf("\n");
+    }
+}
+
+/*�ϧΤ��s���u���j�M*/
+void bfs(int start)
+{
+    Queue* q = createQueue();
+    Node* ptr;
+    
+    // �N�_�l�`�I�[�J��C
+    enqueue(q, start);
+    visited[start] = TRUE;
+    
+    while(!isEmpty(q)) {
+        // �q��C���X�`�I�æL�X
+        int currentVertex = dequeue(q);
+        printf("V%d ", currentVertex);
+        
+        // �N�Ҧ��۾F�B�����X���`�I�[�J��C
+        ptr = adjlist[currentVertex]->link;
+        while(ptr != NULL) {
+            if(!visited[ptr->vertex]) {
+                enqueue(q, ptr->vertex);
+                visited[ptr->vertex] = TRUE;
+            }
+            ptr = ptr->link;
+        }
+    }
+    
+    free(q);
+}
+
+/*�j�M��C�̫�`�I���*/
+Node *searchlast(Node *linklist)
+{
+    Node *ptr;
+    ptr = linklist;
+    while (ptr->link != NULL)
+        ptr = ptr->link;
+    return ptr;
+}
diff --git a/作業/unit12/bfs/bfs.exe b/作業/unit12/bfs/bfs.exe
new file mode 100644
index 0000000..a1f6911
Binary files /dev/null and b/作業/unit12/bfs/bfs.exe differ
diff --git a/作業/unit12/bfs/bfs_down_triangle.cpp b/作業/unit12/bfs/bfs_down_triangle.cpp
new file mode 100644
index 0000000..163ecc2
--- /dev/null
+++ b/作業/unit12/bfs/bfs_down_triangle.cpp
@@ -0,0 +1,242 @@
+/* �ϧΪ��l��: �۾F��C�P�s���u���j�M�k(BFS) - �t�v����� */
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#define MAX_V 100  /*�̤j�`�I��*/
+#define TRUE 1
+#define FALSE 0
+
+/*�w�q��Ƶ��c*/
+typedef struct node_tag {
+    int vertex;
+    struct node_tag *link;
+} Node;
+
+/*�w�q��C���c*/
+typedef struct {
+    int items[MAX_V];
+    int front;
+    int rear;
+} Queue;
+
+Node *adjlist[MAX_V+1];  /*�ŧi�۾F��C*/
+int visited[MAX_V+1];    /*�O�����I�O�_�w���X*/
+int total_vertex;
+int weight_matrix[MAX_V+1][MAX_V+1];  /* �x�s�v���x�} */
+
+void build_adjlist(void);
+void show_adjlist(void);
+void show_weight_matrix(void);  
+void bfs(int);
+Node *searchlast(Node *);
+
+/*��C�ާ@���*/
+Queue* createQueue() {
+    Queue *q = (Queue*)malloc(sizeof(Queue));
+    q->front = -1;
+    q->rear = -1;
+    return q;
+}
+
+int isEmpty(Queue* q) {
+    return q->front == -1;
+}
+
+void enqueue(Queue* q, int value) {
+    if(q->front == -1)
+        q->front = 0;
+    q->rear++;
+    q->items[q->rear] = value;
+}
+
+int dequeue(Queue* q) {
+    int item = q->items[q->front];
+    if(q->front == q->rear) {
+        q->front = -1;
+        q->rear = -1;
+    } else {
+        q->front++;
+    }
+    return item;
+}
+
+int main()
+{
+    build_adjlist();    /*�H�۾F��C���ܹϧ�*/
+    show_weight_matrix(); /*����v���x�}*/
+    show_adjlist();     /*��ܦ�C�����*/
+    puts("\n------Breadth First Search------");
+    bfs(1);          /*�ϧΤ��s���u���j�M�A�H���I1���ҩl���I*/
+    printf("\n");
+    return 0;
+}
+
+void build_adjlist()
+{
+    FILE *fptr;
+    Node *node, *lastnode;
+    int vi, vj;
+    char line[256];
+    int weight;
+    int line_count = 0;
+    
+    fptr = fopen("down_1.dat", "r");
+    if (fptr == NULL) {
+        perror("down_1.dat");
+        exit(0);
+    }
+
+    // �p���`���I��
+    while (fgets(line, sizeof(line), fptr)) {
+        line_count++;
+    }
+    total_vertex = line_count; // �ק�G������1
+    rewind(fptr);
+    
+    // ��l���v���x�}��0
+    for(int i = 0; i <= total_vertex; i++)
+        for(int j = 0; j <= total_vertex; j++)
+            weight_matrix[i][j] = 0;
+
+    // ��l�Ƭ۾F��C
+    for (vi = 1; vi <= total_vertex; vi++) {
+        visited[vi] = FALSE;
+        adjlist[vi] = (Node *)malloc(sizeof(Node));
+        adjlist[vi]->vertex = vi;
+        adjlist[vi]->link = NULL;
+    }
+
+    // Ū���U�T���ίx�}
+    for (vi = 1; vi <= total_vertex; vi++) {
+        // �ק�G�uŪ�����vi�Ӥ����]�U�T�������^
+        for (vj = 1; vj < vi; vj++) {
+            if (fscanf(fptr, "%d", &weight) != 1) {
+                printf("Error reading weight at vi=%d, vj=%d\n", vi, vj);
+                continue;
+            }
+            
+            // �x�s�v����x�}
+            weight_matrix[vi][vj] = weight;
+            weight_matrix[vj][vi] = weight; // �]���O�L�V�ϡA�ҥH����x�s
+            
+            // �Y���۾F���Y�]weight = 1�^�A�h�إ߳s��
+            if (weight == 1) {
+                // �[�J vi -> vj ���s��
+                node = (Node *)malloc(sizeof(Node));
+                node->vertex = vj;
+                node->link = NULL;
+                lastnode = searchlast(adjlist[vi]);
+                lastnode->link = node;
+
+                // �[�J vj -> vi ���s���]�]���O�L�V�ϡ^
+                node = (Node *)malloc(sizeof(Node));
+                node->vertex = vi;
+                node->link = NULL;
+                lastnode = searchlast(adjlist[vj]);
+                lastnode->link = node;
+            }
+        }
+        // Ū���﨤�u�����]�@�w�O0�A�i�H���L�^
+        fscanf(fptr, "%d", &weight);
+    }
+
+    fclose(fptr);
+}
+
+/* �ק�����v���x�}����ơA�Ϩ��M�� */
+void show_weight_matrix()
+{
+    int i, j;
+    printf("\n=== Weight Matrix ===\n");
+    printf("    ");
+    for(j = 1; j <= total_vertex; j++) {
+        printf("V%-3d", j);
+    }
+    printf("\n");
+    
+    for(i = 1; i <= total_vertex; i++) {
+        printf("V%-3d", i);
+        for(j = 1; j <= total_vertex; j++) {
+            printf("%-4d", weight_matrix[i][j]);
+        }
+        printf("\n");
+    }
+    printf("\n");
+}
+
+/*��ܦU�۾F��C�����*/
+void show_adjlist()
+{
+    int index;
+    Node *ptr;
+    puts("Head    adjacency nodes");
+    puts("------------------------------");
+    for (index = 1; index <= total_vertex; index++) {
+        printf("V%-2d ",adjlist[index]->vertex);
+        ptr = adjlist[index]->link;
+        while (ptr != NULL) {
+            printf("--> V%d ",ptr->vertex);
+            ptr = ptr->link;
+        }
+        printf("\n");
+    }
+}
+
+/*�ϧΤ��s���u���j�M*/
+void bfs(int start)
+{
+    Queue* q = createQueue();
+    Node* ptr;
+    
+    // �N�_�l�`�I�[�J��C
+    enqueue(q, start);
+    visited[start] = TRUE;
+    
+    while(!isEmpty(q)) {
+        // �q��C���X�`�I�æL�X
+        int currentVertex = dequeue(q);
+        printf("V%d ", currentVertex);
+        
+        // �N�Ҧ��۾F�B�����X���`�I�[�J��C�A�ë��`�I�s���Ƨ�
+        int neighbors[MAX_V];
+        int neighborCount = 0;
+        
+        // �����Ҧ����X�ݪ��۾F�`�I
+        ptr = adjlist[currentVertex]->link;
+        while(ptr != NULL) {
+            if(!visited[ptr->vertex]) {
+                neighbors[neighborCount++] = ptr->vertex;
+            }
+            ptr = ptr->link;
+        }
+        
+        // �N�۾F�`�I���s���Ƨ�
+        for(int i = 0; i < neighborCount - 1; i++) {
+            for(int j = 0; j < neighborCount - i - 1; j++) {
+                if(neighbors[j] > neighbors[j + 1]) {
+                    int temp = neighbors[j];
+                    neighbors[j] = neighbors[j + 1];
+                    neighbors[j + 1] = temp;
+                }
+            }
+        }
+        
+        // �����ǥ[�J��C
+        for(int i = 0; i < neighborCount; i++) {
+            enqueue(q, neighbors[i]);
+            visited[neighbors[i]] = TRUE;
+        }
+    }
+    
+    free(q);
+}
+
+/*�j�M��C�̫�`�I���*/
+Node *searchlast(Node *linklist)
+{
+    Node *ptr;
+    ptr = linklist;
+    while (ptr->link != NULL)
+        ptr = ptr->link;
+    return ptr;
+}
diff --git a/作業/unit12/bfs/bfs_down_triangle.exe b/作業/unit12/bfs/bfs_down_triangle.exe
new file mode 100644
index 0000000..dec1788
Binary files /dev/null and b/作業/unit12/bfs/bfs_down_triangle.exe differ
diff --git a/作業/unit12/bfs/bfs_up_triangle.cpp b/作業/unit12/bfs/bfs_up_triangle.cpp
new file mode 100644
index 0000000..a316943
--- /dev/null
+++ b/作業/unit12/bfs/bfs_up_triangle.cpp
@@ -0,0 +1,242 @@
+/* �ϧΪ��l��: �۾F��C�P�s���u���j�M�k(BFS) - �t�v����� */
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#define MAX_V 100  /*�̤j�`�I��*/
+#define TRUE 1
+#define FALSE 0
+
+/*�w�q��Ƶ��c*/
+typedef struct node_tag {
+    int vertex;
+    struct node_tag *link;
+} Node;
+
+/*�w�q��C���c*/
+typedef struct {
+    int items[MAX_V];
+    int front;
+    int rear;
+} Queue;
+
+Node *adjlist[MAX_V+1];  /*�ŧi�۾F��C*/
+int visited[MAX_V+1];    /*�O�����I�O�_�w���X*/
+int total_vertex;
+int weight_matrix[MAX_V+1][MAX_V+1];  /* �x�s�v���x�} */
+
+void build_adjlist(void);
+void show_adjlist(void);
+void show_weight_matrix(void);  
+void bfs(int);
+Node *searchlast(Node *);
+
+/*��C�ާ@���*/
+Queue* createQueue() {
+    Queue *q = (Queue*)malloc(sizeof(Queue));
+    q->front = -1;
+    q->rear = -1;
+    return q;
+}
+
+int isEmpty(Queue* q) {
+    return q->front == -1;
+}
+
+void enqueue(Queue* q, int value) {
+    if(q->front == -1)
+        q->front = 0;
+    q->rear++;
+    q->items[q->rear] = value;
+}
+
+int dequeue(Queue* q) {
+    int item = q->items[q->front];
+    if(q->front == q->rear) {
+        q->front = -1;
+        q->rear = -1;
+    } else {
+        q->front++;
+    }
+    return item;
+}
+
+int main()
+{
+    build_adjlist();    /*�H�۾F��C���ܹϧ�*/
+    show_weight_matrix(); /*����v���x�}*/
+    show_adjlist();     /*��ܦ�C�����*/
+    puts("\n------Breadth First Search------");
+    bfs(1);          /*�ϧΤ��s���u���j�M�A�H���I1���ҩl���I*/
+    printf("\n");
+    return 0;
+}
+
+void build_adjlist()
+{
+    FILE *fptr;
+    Node *node, *lastnode;
+    int vi, vj;
+    char line[256];
+    int weight;
+    int line_count = 0;
+    
+	fptr = fopen("up_1.dat", "r");
+	    if (fptr == NULL) {
+	        perror("up_1.dat");
+	        exit(0);
+	    }
+	
+	 while (fgets(line, sizeof(line), fptr)) {
+        line_count++;
+    }
+    total_vertex = line_count ;
+    rewind(fptr); // ���m�ɮ׫��Ш�}�Y�H���sŪ���x�}
+	    
+    /* ��l���v���x�}��0 */
+    for(int i = 0; i <= total_vertex; i++)
+        for(int j = 0; j <= total_vertex; j++)
+            weight_matrix[i][j] = 0;
+
+    /* ��l�Ƭ۾F��C */
+    for (vi = 1; vi <= total_vertex; vi++) {
+        visited[vi] = FALSE;
+        adjlist[vi] = (Node *)malloc(sizeof(Node));
+        adjlist[vi]->vertex = vi;
+        adjlist[vi]->link = NULL;
+    }
+
+    /* Ū���W�T���ίx�} */
+    for (vi = 1; vi <= total_vertex; vi++) {
+        /* Ū���Ӧ檺�ƭ� */
+        for (vj = vi ; vj <= total_vertex; vj++) {
+            if (fscanf(fptr, "%d", &weight) != 1) {
+                printf("Error reading weight at vi=%d, vj=%d\n", vi, vj);
+                continue;
+            }
+            
+            /* �x�s�v����x�} */
+            weight_matrix[vi][vj] = weight;
+            weight_matrix[vj][vi] = weight; /* �]���O�L�V�ϡA�ҥH����x�s */
+            
+            /* �Y���۾F���Y�]weight = 1�^�A�h�إ߳s�� */
+            if (weight == 1) {
+                /* �[�J vi -> vj ���s�� */
+                node = (Node *)malloc(sizeof(Node));
+                node->vertex = vj;
+                node->link = NULL;
+                lastnode = searchlast(adjlist[vi]);
+                lastnode->link = node;
+
+                /* �[�J vj -> vi ���s���]�]���O�L�V�ϡ^ */
+                node = (Node *)malloc(sizeof(Node));
+                node->vertex = vi;
+                node->link = NULL;
+                lastnode = searchlast(adjlist[vj]);
+                lastnode->link = node;
+            }
+        }
+        /* ����U�@�� */
+        fscanf(fptr, "%*[^\n]");
+        fscanf(fptr, "%*c");
+    }
+
+    fclose(fptr);
+}
+
+/* �ק�����v���x�}����ơA�Ϩ��M�� */
+void show_weight_matrix()
+{
+    int i, j;
+    printf("\n=== Weight Matrix ===\n");
+    printf("    ");
+    for(j = 1; j <= total_vertex; j++) {
+        printf("V%-3d", j);
+    }
+    printf("\n");
+    
+    for(i = 1; i <= total_vertex; i++) {
+        printf("V%-3d", i);
+        for(j = 1; j <= total_vertex; j++) {
+            printf("%-4d", weight_matrix[i][j]);
+        }
+        printf("\n");
+    }
+    printf("\n");
+}
+
+/*��ܦU�۾F��C�����*/
+void show_adjlist()
+{
+    int index;
+    Node *ptr;
+    puts("Head    adjacency nodes");
+    puts("------------------------------");
+    for (index = 1; index <= total_vertex; index++) {
+        printf("V%-2d ",adjlist[index]->vertex);
+        ptr = adjlist[index]->link;
+        while (ptr != NULL) {
+            printf("--> V%d ",ptr->vertex);
+            ptr = ptr->link;
+        }
+        printf("\n");
+    }
+}
+
+/*�ϧΤ��s���u���j�M*/
+void bfs(int start)
+{
+    Queue* q = createQueue();
+    Node* ptr;
+    
+    // �N�_�l�`�I�[�J��C
+    enqueue(q, start);
+    visited[start] = TRUE;
+    
+    while(!isEmpty(q)) {
+        // �q��C���X�`�I�æL�X
+        int currentVertex = dequeue(q);
+        printf("V%d ", currentVertex);
+        
+        // �N�Ҧ��۾F�B�����X���`�I�[�J��C�A�ë��`�I�s���Ƨ�
+        int neighbors[MAX_V];
+        int neighborCount = 0;
+        
+        // �����Ҧ����X�ݪ��۾F�`�I
+        ptr = adjlist[currentVertex]->link;
+        while(ptr != NULL) {
+            if(!visited[ptr->vertex]) {
+                neighbors[neighborCount++] = ptr->vertex;
+            }
+            ptr = ptr->link;
+        }
+        
+        // �N�۾F�`�I���s���Ƨ�
+        for(int i = 0; i < neighborCount - 1; i++) {
+            for(int j = 0; j < neighborCount - i - 1; j++) {
+                if(neighbors[j] > neighbors[j + 1]) {
+                    int temp = neighbors[j];
+                    neighbors[j] = neighbors[j + 1];
+                    neighbors[j + 1] = temp;
+                }
+            }
+        }
+        
+        // �����ǥ[�J��C
+        for(int i = 0; i < neighborCount; i++) {
+            enqueue(q, neighbors[i]);
+            visited[neighbors[i]] = TRUE;
+        }
+    }
+    
+    free(q);
+}
+
+/*�j�M��C�̫�`�I���*/
+Node *searchlast(Node *linklist)
+{
+    Node *ptr;
+    ptr = linklist;
+    while (ptr->link != NULL)
+        ptr = ptr->link;
+    return ptr;
+}
diff --git a/作業/unit12/bfs/bfs_up_triangle.exe b/作業/unit12/bfs/bfs_up_triangle.exe
new file mode 100644
index 0000000..021dd66
Binary files /dev/null and b/作業/unit12/bfs/bfs_up_triangle.exe differ
diff --git a/作業/unit12/bfs/dfs.dat b/作業/unit12/bfs/dfs.dat
new file mode 100644
index 0000000..fa925fa
--- /dev/null
+++ b/作業/unit12/bfs/dfs.dat
@@ -0,0 +1,10 @@
+0 1 1 0 0 0 0 0 0 0
+1 0 0 1 1 0 0 0 0 0
+1 0 0 0 0 1 1 0 0 0
+0 1 0 0 0 0 0 1 0 0
+0 1 0 0 0 0 0 1 0 0
+0 0 1 0 0 0 0 0 1 0
+0 0 1 0 0 0 0 0 1 0
+0 0 0 1 1 0 0 0 0 1
+0 0 0 0 0 1 1 0 0 1
+0 0 0 0 0 0 0 1 1 0
\ No newline at end of file
diff --git a/作業/unit12/bfs/down_1.dat b/作業/unit12/bfs/down_1.dat
new file mode 100644
index 0000000..2060205
--- /dev/null
+++ b/作業/unit12/bfs/down_1.dat
@@ -0,0 +1,10 @@
+0 
+1 0 
+1 0 0 
+0 1 0 0 
+0 1 0 0 0 
+0 0 1 0 0 0
+0 0 1 0 0 0 0
+0 0 0 1 1 0 0 0
+0 0 0 0 0 1 1 0 0
+0 0 0 0 0 0 0 1 1 0
diff --git a/作業/unit12/bfs/down_2.dat b/作業/unit12/bfs/down_2.dat
new file mode 100644
index 0000000..f76d854
--- /dev/null
+++ b/作業/unit12/bfs/down_2.dat
@@ -0,0 +1,9 @@
+0 
+1 0 
+0 1 0 
+0 0 1 0 
+0 0 1 0 0 
+0 0 0 1 0 0 
+0 0 0 1 0 0 0 
+0 0 0 0 1 0 1 0  
+0 0 0 1 1 0 0 0 0 
\ No newline at end of file
diff --git a/作業/unit12/bfs/up_1.dat b/作業/unit12/bfs/up_1.dat
new file mode 100644
index 0000000..d8c2c96
--- /dev/null
+++ b/作業/unit12/bfs/up_1.dat
@@ -0,0 +1,9 @@
+0 1 0 0 0 0 0 0 0 
+  0 1 0 0 0 0 0 0 
+    0 1 1 0 0 0 0 
+      0 0 1 1 0 1 
+        0 0 0 1 1 
+          0 0 0 0 
+            0 1 0 
+              0 0 
+                0
\ No newline at end of file
diff --git a/作業/unit12/bfs/up_2.dat b/作業/unit12/bfs/up_2.dat
new file mode 100644
index 0000000..1bf3d6e
--- /dev/null
+++ b/作業/unit12/bfs/up_2.dat
@@ -0,0 +1,10 @@
+0 1 1 0 0 0 0 0 0 0
+  0 0 1 1 0 0 0 0 0
+    0 0 0 1 1 0 0 0
+      0 0 0 0 1 0 0
+        0 0 0 1 0 0
+          0 0 0 1 0
+            0 0 1 0
+              0 0 1
+                0 1
+                  0
\ No newline at end of file
diff --git a/作業/unit12/bfs/聖.dat b/作業/unit12/bfs/聖.dat
new file mode 100644
index 0000000..1bf3d6e
--- /dev/null
+++ b/作業/unit12/bfs/聖.dat
@@ -0,0 +1,10 @@
+0 1 1 0 0 0 0 0 0 0
+  0 0 1 1 0 0 0 0 0
+    0 0 0 1 1 0 0 0
+      0 0 0 0 1 0 0
+        0 0 0 1 0 0
+          0 0 0 1 0
+            0 0 1 0
+              0 0 1
+                0 1
+                  0
\ No newline at end of file
diff --git a/作業/unit12/dfs/dfs.cpp b/作業/unit12/dfs/dfs.cpp
new file mode 100644
index 0000000..de6884c
--- /dev/null
+++ b/作業/unit12/dfs/dfs.cpp
@@ -0,0 +1,127 @@
+/* file name: dfs.c */
+/* �ϧΪ��l��: �۾F��C�P�ܦV�u���j�M�k(DFS)*/
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#define MAX_V 100  /*�̤j�`�I��*/
+#define TRUE 1
+#define FALSE 0
+
+/*�w�q��Ƶ��c*/
+typedef struct node_tag {
+    int vertex;
+    struct node_tag *link;
+} Node;
+
+Node *adjlist[MAX_V+1];  /*�ŧi�۾F��C*/
+int visited[MAX_V+1];    /*�O�����I�O�_�w���X*/
+int total_vertex;
+
+
+void build_adjlist(void);
+void show_adjlist(void);
+void dfs(int);
+Node *searchlast(Node *);
+
+int main()
+{
+    build_adjlist(); /*�H�۾F��C���ܹϧ�*/
+    show_adjlist();  /*��ܦ�C�����*/
+    puts("\n------Depth Fisrt Search------");
+    dfs(1);          /*�ϧΤ��ܦV�u���j�M�A�H���I1���ҩl���I*/
+    printf("\n");
+    return 0;
+}
+
+void build_adjlist()
+{
+    FILE *fptr;
+    Node *node,*lastnode;
+    int vi,vj ,weight;
+
+    fptr = fopen("dfs.dat", "r");
+    if (fptr == NULL) {
+        perror("dfs.dat");
+        exit(0);
+    }
+
+    /* Ū���`�I�`�� */
+    fscanf(fptr, "%d", &total_vertex);
+    for (vi = 1; vi <= total_vertex; vi++) {
+        /*�]�w�}�C�ΦU��C�ҩl��*/
+        visited[vi] = FALSE;
+        adjlist[vi] = (Node *)malloc(sizeof(Node));
+        adjlist[vi]->vertex = vi;
+        adjlist[vi]->link = NULL;
+    }
+
+    /* Ū���`�I��� */
+    for (vi = 1; vi <= total_vertex; vi++)
+        for (vj = 1; vj <= total_vertex; vj++) {
+            fscanf(fptr,"%d",&weight);
+            /* ����ɥH�۾F�x�}�榡�x�s,�H1�N���۾F
+               0 �N�����۾F�A�N�۾F���I�쵲�b�U��C�� */
+            if (weight != 0) {
+                node = (Node *)malloc(sizeof(Node));
+                node->vertex = vj;
+                node->link = NULL;
+                lastnode = searchlast(adjlist[vi]);
+                lastnode->link = node;
+            }
+        }
+    fclose(fptr);
+}
+
+/*��ܦU�۾F��C�����*/
+void show_adjlist()
+{
+    int index;
+    Node *ptr;
+
+    puts("Head    adjacency nodes");
+    puts("------------------------------");
+    for (index = 1; index <= total_vertex; index++) {
+        printf("V%-2d ",adjlist[index]->vertex);
+        ptr = adjlist[index]->link;
+        while (ptr != NULL) {
+            printf("--> V%d ",ptr->vertex);
+            ptr = ptr->link;
+        }
+        printf("\n");
+    }
+}
+
+/*�ϧΤ��ܦV�u���j�M*/
+void dfs(int v)
+{
+    Node *ptr;
+    int w;
+
+    printf("V%d ",adjlist[v]->vertex);
+    visited[v] = TRUE;          /*�]�wv���I���w���X�L*/
+    ptr = adjlist[v]->link;     /*���X�۾F���I*/
+
+    do {
+        /* �Y���I�|�����X�A�h�H�����I���s�ҩl�I�~��
+           ���ܦV�u���j�M�k���X�A�_�h��P��۾F�����I
+           ����Ҧ��۳s�����`�I���w���X         */
+        w = ptr->vertex;
+        if (!visited[w])
+            dfs(w);
+        else
+            ptr = ptr->link;
+    } while (ptr != NULL);
+}
+
+/*�j�M��C�̫�`�I���*/
+Node *searchlast( Node *linklist )
+{
+    Node *ptr;
+
+    ptr = linklist;
+    while (ptr->link != NULL)
+        ptr = ptr->link;
+    return ptr;
+}
+
diff --git a/作業/unit12/dfs/dfs.dat b/作業/unit12/dfs/dfs.dat
new file mode 100644
index 0000000..2cbfb09
--- /dev/null
+++ b/作業/unit12/dfs/dfs.dat
@@ -0,0 +1,11 @@
+10
+0 1 1 0 0 0 0 0 0 0
+1 0 0 1 1 0 0 0 0 0
+1 0 0 0 0 1 1 0 0 0
+0 1 0 0 0 0 0 1 0 0
+0 1 0 0 0 0 0 1 0 0
+0 0 1 0 0 0 0 0 1 0
+0 0 1 0 0 0 0 0 1 0
+0 0 0 1 1 0 0 0 0 1
+0 0 0 0 0 1 1 0 0 1
+0 0 0 0 0 0 0 1 1 0
diff --git a/作業/unit12/dfs/dfs.exe b/作業/unit12/dfs/dfs.exe
new file mode 100644
index 0000000..7e7b8ef
Binary files /dev/null and b/作業/unit12/dfs/dfs.exe differ
diff --git a/作業/unit12/dfs/dfs_down_triangle.cpp b/作業/unit12/dfs/dfs_down_triangle.cpp
new file mode 100644
index 0000000..0b74b85
--- /dev/null
+++ b/作業/unit12/dfs/dfs_down_triangle.cpp
@@ -0,0 +1,178 @@
+/* file name: dfs.c */
+/* �ϧΪ��l��: �۾F��C�P�ܦV�u���j�M�k(DFS)*/
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#define MAX_V 100  /*�̤j�`�I��*/
+#define TRUE 1
+#define FALSE 0
+
+/*�w�q��Ƶ��c*/
+typedef struct node_tag {
+    int vertex;
+    struct node_tag *link;
+} Node;
+
+Node *adjlist[MAX_V+1];  /*�ŧi�۾F��C*/
+int visited[MAX_V+1];    /*�O�����I�O�_�w���X*/
+int total_vertex;
+
+
+void build_adjlist(void);
+void show_adjlist(void);
+void show_weight_matrix(void);
+void dfs(int);
+Node *searchlast(Node *);
+int weight_matrix[MAX_V+1][MAX_V+1];  /* �x�s�v���x�} */
+
+int main()
+{
+    build_adjlist(); /*�H�۾F��C���ܹϧ�*/
+    show_weight_matrix(); /*����v���x�}*/
+    show_adjlist();  /*��ܦ�C�����*/
+    puts("\n------Depth Fisrt Search------");
+    dfs(1);          /*�ϧΤ��ܦV�u���j�M�A�H���I1���ҩl���I*/
+    printf("\n");
+    return 0;
+}
+
+void build_adjlist()
+{
+    FILE *fptr;
+    Node *node, *lastnode;
+    int vi, vj, weight;
+    char line[256];
+    int line_count = 0;
+    
+    fptr = fopen("down_1.dat", "r");
+    if (fptr == NULL) {
+        perror("down_1.dat");
+        exit(0);
+    }
+
+    // �p���`���I��
+    while (fgets(line, sizeof(line), fptr)) {
+        line_count++;
+    }
+    total_vertex = line_count;  // �`���I�Ƶ�����
+    rewind(fptr);
+
+    // ��l�ư}�C�ΦU��C�ҩl��
+    for (vi = 1; vi <= total_vertex; vi++) {
+        visited[vi] = FALSE;
+        adjlist[vi] = (Node *)malloc(sizeof(Node));
+        adjlist[vi]->vertex = vi;
+        adjlist[vi]->link = NULL;
+    }
+
+    // Ū���U�T���x�}
+    for (vi = 1; vi <= total_vertex; vi++) {
+        // �uŪ�����vi�Ӥ����]�U�T�������^
+        for (vj = 1; vj < vi; vj++) {
+            if (fscanf(fptr, "%d", &weight) != 1) {
+                printf("Error reading weight at vi=%d, vj=%d\n", vi, vj);
+                continue;
+            }
+            
+            // �x�s�v����x�}
+            weight_matrix[vi][vj] = weight;
+            weight_matrix[vj][vi] = weight; // �]���O�L�V�ϡA�ҥH����x�s
+            
+            // �p�G�۾F�]weight = 1�^�A�h�إ߳s��
+            if (weight == 1) {
+                // �[�J vi -> vj ���s��
+                node = (Node *)malloc(sizeof(Node));
+                node->vertex = vj;
+                node->link = NULL;
+                lastnode = searchlast(adjlist[vi]);
+                lastnode->link = node;
+
+                // �[�J vj -> vi ���s���]�]���O�L�V�ϡ^
+                node = (Node *)malloc(sizeof(Node));
+                node->vertex = vi;
+                node->link = NULL;
+                lastnode = searchlast(adjlist[vj]);
+                lastnode->link = node;
+            }
+        }
+        // Ū���﨤�u�����]�@�w�O0�^
+        fscanf(fptr, "%d", &weight);
+    }
+
+    fclose(fptr);
+}
+
+/*��ܦU�۾F��C�����*/
+void show_adjlist()
+{
+    int index;
+    Node *ptr;
+
+    puts("Head    adjacency nodes");
+    puts("------------------------------");
+    for (index = 1; index <= total_vertex; index++) {
+        printf("V%-2d ",adjlist[index]->vertex);
+        ptr = adjlist[index]->link;
+        while (ptr != NULL) {
+            printf("--> V%d ",ptr->vertex);
+            ptr = ptr->link;
+        }
+        printf("\n");
+    }
+}
+
+/* �ק�����v���x�}����ơA�Ϩ��M�� */
+void show_weight_matrix()
+{
+    int i, j;
+    printf("\n=== Weight Matrix ===\n");
+    printf("    ");
+    for(j = 1; j <= total_vertex; j++) {
+        printf("V%-3d", j);
+    }
+    printf("\n");
+    
+    for(i = 1; i <= total_vertex; i++) {
+        printf("V%-3d", i);
+        for(j = 1; j <= total_vertex; j++) {
+            printf("%-4d", weight_matrix[i][j]);
+        }
+        printf("\n");
+    }
+    printf("\n");
+}
+
+/*�ϧΤ��ܦV�u���j�M*/
+void dfs(int v)
+{
+    Node *ptr;
+    int w;
+
+    printf("V%d ",adjlist[v]->vertex);
+    visited[v] = TRUE;          /*�]�wv���I���w���X�L*/
+    ptr = adjlist[v]->link;     /*���X�۾F���I*/
+
+    do {
+        /* �Y���I�|�����X�A�h�H�����I���s�ҩl�I�~��
+           ���ܦV�u���j�M�k���X�A�_�h��P��۾F�����I
+           ����Ҧ��۳s�����`�I���w���X         */
+        w = ptr->vertex;
+        if (!visited[w])
+            dfs(w);
+        else
+            ptr = ptr->link;
+    } while (ptr != NULL);
+}
+
+/*�j�M��C�̫�`�I���*/
+Node *searchlast( Node *linklist )
+{
+    Node *ptr;
+
+    ptr = linklist;
+    while (ptr->link != NULL)
+        ptr = ptr->link;
+    return ptr;
+}
+
diff --git a/作業/unit12/dfs/dfs_down_triangle.exe b/作業/unit12/dfs/dfs_down_triangle.exe
new file mode 100644
index 0000000..d41fd26
Binary files /dev/null and b/作業/unit12/dfs/dfs_down_triangle.exe differ
diff --git a/作業/unit12/dfs/dfs_up_triangle.cpp b/作業/unit12/dfs/dfs_up_triangle.cpp
new file mode 100644
index 0000000..95515fc
--- /dev/null
+++ b/作業/unit12/dfs/dfs_up_triangle.cpp
@@ -0,0 +1,178 @@
+/* file name: dfs.c */
+/* �ϧΪ��l��: �۾F��C�P�ܦV�u���j�M�k(DFS)*/
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#define MAX_V 100  /*�̤j�`�I��*/
+#define TRUE 1
+#define FALSE 0
+
+/*�w�q��Ƶ��c*/
+typedef struct node_tag {
+    int vertex;
+    struct node_tag *link;
+} Node;
+
+Node *adjlist[MAX_V+1];  /*�ŧi�۾F��C*/
+int visited[MAX_V+1];    /*�O�����I�O�_�w���X*/
+int total_vertex;
+
+
+void build_adjlist(void);
+void show_adjlist(void);
+void show_weight_matrix(void);
+void dfs(int);
+Node *searchlast(Node *);
+int weight_matrix[MAX_V+1][MAX_V+1];  /* �x�s�v���x�} */
+
+int main()
+{
+    build_adjlist(); /*�H�۾F��C���ܹϧ�*/
+    show_weight_matrix(); /*����v���x�}*/
+    show_adjlist();  /*��ܦ�C�����*/
+    puts("\n------Depth Fisrt Search------");
+    dfs(1);          /*�ϧΤ��ܦV�u���j�M�A�H���I1���ҩl���I*/
+    printf("\n");
+    return 0;
+}
+
+void build_adjlist()
+{
+    FILE *fptr;
+    Node *node, *lastnode;
+    int vi, vj, weight;
+    char line[256];
+    int line_count = 0;
+    
+    fptr = fopen("up_1.dat", "r");
+    if (fptr == NULL) {
+        perror("up_2.dat");
+        exit(0);
+    }
+
+    // �p���`���I��
+    while (fgets(line, sizeof(line), fptr)) {
+        line_count++;
+    }
+    total_vertex = line_count;
+    rewind(fptr);
+
+    // ��l�ư}�C�ΦU��C�ҩl��
+    for (vi = 1; vi <= total_vertex; vi++) {
+        visited[vi] = FALSE;
+        adjlist[vi] = (Node *)malloc(sizeof(Node));
+        adjlist[vi]->vertex = vi;
+        adjlist[vi]->link = NULL;
+    }
+
+    // Ū���W�T���x�}
+    for (vi = 1; vi <= total_vertex; vi++) {
+        /* Ū���Ӧ檺�ƭ� */
+        for (vj = vi ; vj <= total_vertex; vj++) {
+            if (fscanf(fptr, "%d", &weight) != 1) {
+                printf("Error reading weight at vi=%d, vj=%d\n", vi, vj);
+                continue;
+            }
+            
+            // �x�s�v����x�}
+            weight_matrix[vi][vj] = weight;
+            weight_matrix[vj][vi] = weight; // �]���O�L�V�ϡA�ҥH����x�s
+            
+            // �p�G�۾F�]weight = 1�^�A�h�إ߳s��
+            if (weight == 1) {
+                // �[�J vi -> vj ���s��
+                node = (Node *)malloc(sizeof(Node));
+                node->vertex = vj;
+                node->link = NULL;
+                lastnode = searchlast(adjlist[vi]);
+                lastnode->link = node;
+
+                // �[�J vj -> vi ���s���]�]���O�L�V�ϡ^
+                if (vi != vj) {  // �קK����
+                    node = (Node *)malloc(sizeof(Node));
+                    node->vertex = vi;
+                    node->link = NULL;
+                    lastnode = searchlast(adjlist[vj]);
+                    lastnode->link = node;
+                }
+            }
+        }
+    }
+
+    fclose(fptr);
+}
+
+/*��ܦU�۾F��C�����*/
+void show_adjlist()
+{
+    int index;
+    Node *ptr;
+
+    puts("Head    adjacency nodes");
+    puts("------------------------------");
+    for (index = 1; index <= total_vertex; index++) {
+        printf("V%-2d ",adjlist[index]->vertex);
+        ptr = adjlist[index]->link;
+        while (ptr != NULL) {
+            printf("--> V%d ",ptr->vertex);
+            ptr = ptr->link;
+        }
+        printf("\n");
+    }
+}
+
+/* �ק�����v���x�}����ơA�Ϩ��M�� */
+void show_weight_matrix()
+{
+    int i, j;
+    printf("\n=== Weight Matrix ===\n");
+    printf("    ");
+    for(j = 1; j <= total_vertex; j++) {
+        printf("V%-3d", j);
+    }
+    printf("\n");
+    
+    for(i = 1; i <= total_vertex; i++) {
+        printf("V%-3d", i);
+        for(j = 1; j <= total_vertex; j++) {
+            printf("%-4d", weight_matrix[i][j]);
+        }
+        printf("\n");
+    }
+    printf("\n");
+}
+
+/*�ϧΤ��ܦV�u���j�M*/
+void dfs(int v)
+{
+    Node *ptr;
+    int w;
+
+    printf("V%d ",adjlist[v]->vertex);
+    visited[v] = TRUE;          /*�]�wv���I���w���X�L*/
+    ptr = adjlist[v]->link;     /*���X�۾F���I*/
+
+    do {
+        /* �Y���I�|�����X�A�h�H�����I���s�ҩl�I�~��
+           ���ܦV�u���j�M�k���X�A�_�h��P��۾F�����I
+           ����Ҧ��۳s�����`�I���w���X         */
+        w = ptr->vertex;
+        if (!visited[w])
+            dfs(w);
+        else
+            ptr = ptr->link;
+    } while (ptr != NULL);
+}
+
+/*�j�M��C�̫�`�I���*/
+Node *searchlast( Node *linklist )
+{
+    Node *ptr;
+
+    ptr = linklist;
+    while (ptr->link != NULL)
+        ptr = ptr->link;
+    return ptr;
+}
+
diff --git a/作業/unit12/dfs/dfs_up_triangle.exe b/作業/unit12/dfs/dfs_up_triangle.exe
new file mode 100644
index 0000000..e7789e4
Binary files /dev/null and b/作業/unit12/dfs/dfs_up_triangle.exe differ
diff --git a/作業/unit12/dfs/down_1.dat b/作業/unit12/dfs/down_1.dat
new file mode 100644
index 0000000..2060205
--- /dev/null
+++ b/作業/unit12/dfs/down_1.dat
@@ -0,0 +1,10 @@
+0 
+1 0 
+1 0 0 
+0 1 0 0 
+0 1 0 0 0 
+0 0 1 0 0 0
+0 0 1 0 0 0 0
+0 0 0 1 1 0 0 0
+0 0 0 0 0 1 1 0 0
+0 0 0 0 0 0 0 1 1 0
diff --git a/作業/unit12/dfs/down_2.dat b/作業/unit12/dfs/down_2.dat
new file mode 100644
index 0000000..f76d854
--- /dev/null
+++ b/作業/unit12/dfs/down_2.dat
@@ -0,0 +1,9 @@
+0 
+1 0 
+0 1 0 
+0 0 1 0 
+0 0 1 0 0 
+0 0 0 1 0 0 
+0 0 0 1 0 0 0 
+0 0 0 0 1 0 1 0  
+0 0 0 1 1 0 0 0 0 
\ No newline at end of file
diff --git a/作業/unit12/dfs/up_1.dat b/作業/unit12/dfs/up_1.dat
new file mode 100644
index 0000000..d8c2c96
--- /dev/null
+++ b/作業/unit12/dfs/up_1.dat
@@ -0,0 +1,9 @@
+0 1 0 0 0 0 0 0 0 
+  0 1 0 0 0 0 0 0 
+    0 1 1 0 0 0 0 
+      0 0 1 1 0 1 
+        0 0 0 1 1 
+          0 0 0 0 
+            0 1 0 
+              0 0 
+                0
\ No newline at end of file
diff --git a/作業/unit12/dfs/up_2.dat b/作業/unit12/dfs/up_2.dat
new file mode 100644
index 0000000..1bf3d6e
--- /dev/null
+++ b/作業/unit12/dfs/up_2.dat
@@ -0,0 +1,10 @@
+0 1 1 0 0 0 0 0 0 0
+  0 0 1 1 0 0 0 0 0
+    0 0 0 1 1 0 0 0
+      0 0 0 0 1 0 0
+        0 0 0 1 0 0
+          0 0 0 1 0
+            0 0 1 0
+              0 0 1
+                0 1
+                  0
\ No newline at end of file
diff --git a/作業/unit12/down_1.dat b/作業/unit12/down_1.dat
new file mode 100644
index 0000000..2060205
--- /dev/null
+++ b/作業/unit12/down_1.dat
@@ -0,0 +1,10 @@
+0 
+1 0 
+1 0 0 
+0 1 0 0 
+0 1 0 0 0 
+0 0 1 0 0 0
+0 0 1 0 0 0 0
+0 0 0 1 1 0 0 0
+0 0 0 0 0 1 1 0 0
+0 0 0 0 0 0 0 1 1 0
diff --git a/作業/unit12/down_2.dat b/作業/unit12/down_2.dat
new file mode 100644
index 0000000..f76d854
--- /dev/null
+++ b/作業/unit12/down_2.dat
@@ -0,0 +1,9 @@
+0 
+1 0 
+0 1 0 
+0 0 1 0 
+0 0 1 0 0 
+0 0 0 1 0 0 
+0 0 0 1 0 0 0 
+0 0 0 0 1 0 1 0  
+0 0 0 1 1 0 0 0 0 
\ No newline at end of file
diff --git a/作業/unit12/shortestPath.c b/作業/unit12/shortestPath.c
new file mode 100644
index 0000000..e302293
--- /dev/null
+++ b/作業/unit12/shortestPath.c
@@ -0,0 +1,174 @@
+/* file name: shortestPath.c */
+/* �Q�� Dijkstra �t��k�D�̵u���| */
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#define MAX_V 100   /*�̤j�`�I��*/
+#define VISITED 1
+#define NOTVISITED 0
+#define Infinite 1073741823
+
+/* A[1..N][1..N] ���ϧΪ��۾F�x�} */
+/* D[i] i=1..N �Ψ��x�s�Y�_�l���I��i�`�I���̵u�Z�� */
+/* S[1..N] �ΨӰO�����I�O�_�w�g���X�L */
+/* P[1..N] �ΨӰO���̪�g�L�������`�I */
+
+long int A[MAX_V+1][MAX_V+1];
+long int D[MAX_V+1];
+long int S[MAX_V+1], P[MAX_V+1];
+int source , sink , N;
+int step = 1;
+
+int top = -1;         /*���|����*/
+int Stack[MAX_V+1];   /*���|�Ŷ�*/
+
+void init(void);
+int minD(void);
+void output_step(void);
+void output_path(void);
+void push(int);
+int pop(void);
+
+int main(){
+    int t,I;
+
+    init();
+    output_step();
+	printf("\n");
+    for (step =2;step <=N; step++) {
+        /* minD �Ǧ^�@��t�ϱoD[t] ���̤p */
+        t = minD();
+        S[t] = VISITED;
+        /* ��X�g�Lt�I�|�ϸ��|�Y�u���`�I*/
+        for (I=1; I <= N; I++)
+        if ((S[I] == NOTVISITED) && (D[t]+A[t][I] <= D[I])) {
+            D[I] = D[t] + A[t][I];
+            P[I] = t;
+        }
+        output_step();
+        printf("\n");
+    }
+    output_path();
+
+    return 0;
+}
+
+void init(){
+    FILE *fptr;
+    int i,j;
+    int weight;
+
+    fptr = fopen("shortestPath_2.dat","r");
+    if (fptr == NULL) {
+        perror("shortestPath.dat");
+        exit(1);
+    }
+
+    fscanf(fptr, "%d", &N);      /*Ū���ϧθ`�I��*/
+    for (i=1; i<=N; i++ )
+        for (j=1; j<=N; j++)
+            A[i][j] = Infinite;  /*�_�lA[1..N][1..N]�۾F�x�}*/
+ 
+    while (fscanf(fptr,"%d %d %d", &i, &j, &weight) != EOF)
+    A[i][j] = weight;             /*Ū��i�`�I��j�`�I���vweight */
+    fclose(fptr);
+    
+    
+
+    printf("Enter source node : ");
+    scanf("%d", &source);
+    printf("Enter sink node : ");
+    scanf("%d", &sink);
+
+    /* �_�l�U�}�C���*/
+    for (i = 1; i <= N; i++) {
+        S[i] = NOTVISITED;   /*�U���I�]���|�����X*/
+        D[i] = A[source][i]; /*�O���_�l���I�ܦU���I�̵u�Z��*/
+        P[i] = source;
+    }
+    S[source] = VISITED;     /*�l�_�`�I�]���w�g���X*/
+    D[source] = 0;
+}
+
+int minD(){
+    int i,t;
+    long int minimum = Infinite;
+
+    for (i=1; i<=N; i++)
+        if ((S[i] == NOTVISITED) && D[i] < minimum) {
+            minimum = D[i];
+            t = i;
+        }
+
+    return t;
+}
+
+/* ��ܥثe��D�}�C�PP�}�C���p */
+void output_step(){
+    int i;
+
+    printf("\n Step #%d",step);
+    printf("\n================================================\n");
+    for (i=1; i<=N; i++)
+        printf("  D[%d]", i);
+    printf("\n");
+    for (i=1; i<=N; i++)
+        if (D[i] == Infinite)
+            printf("  ----");
+        else
+            printf("%6ld",D[i]);
+    printf("\n================================================\n");
+    for (i=1; i<=N; i++)
+        printf("  P[%d]", i);
+    printf("\n");
+    for (i=1; i<=N;i++)
+        printf("%6ld", P[i]);
+}
+
+/*��̵ܳu���|*/
+void output_path(){
+    int node = sink;
+
+    /*�P�_�O�_�_�l���I������I�εL���|�ܲ��I*/
+    if ((sink == source) || (D[sink] == Infinite)) {
+        printf("\nNode %d has no Path to Node %d", source, sink);
+        return;
+    }
+
+    printf("\n");
+    printf(" The shortest  Path from V%d to V%d :", source, sink);
+    printf("\n------------------------------------------\n");
+
+    /*�Ѳ��I�}�l�N�W�@���g�L�������`�I���J���|�ܨ�_�l�`�I*/
+    printf("  V%d", source);
+    while (node != source) {
+        push(node);
+        node = P[node];
+    }
+	while(node != sink) {
+        node = pop();
+        printf(" --%ld-->",A[P[node]][node]);
+        printf("V%d", node);
+    }
+
+    printf("\n Total length : %ld\n", D[sink]);
+}
+
+void push(int value){
+    if (top >= MAX_V) {
+        printf("Stack overflow!\n");
+        exit(1);
+    }else
+        Stack[++top] = value;
+}
+
+int pop(){
+    if (top < 0) {
+        printf("Stack empty!\n");
+        exit(1);
+    }
+
+    return Stack[top--];
+}
+
diff --git a/作業/unit12/shortestPath.exe b/作業/unit12/shortestPath.exe
new file mode 100644
index 0000000..a081242
Binary files /dev/null and b/作業/unit12/shortestPath.exe differ
diff --git a/作業/unit12/shortestPath_1.dat b/作業/unit12/shortestPath_1.dat
new file mode 100644
index 0000000..510ff56
--- /dev/null
+++ b/作業/unit12/shortestPath_1.dat
@@ -0,0 +1,25 @@
+7 
+1 2 4
+1 3 6
+1 4 6
+2 3 1
+2 5 7
+3 5 6
+3 6 4
+4 3 2
+4 6 5
+5 7 -6
+6 5 1 
+6 7 8
+2 1 4
+3 1 6
+4 1 6
+3 2 1
+3 4 2
+5 2 7
+5 3 6
+5 6 1
+6 4 5
+6 3 4
+7 5 -6
+7 6 8
diff --git a/作業/unit12/shortestPath_2.dat b/作業/unit12/shortestPath_2.dat
new file mode 100644
index 0000000..24e4e93
--- /dev/null
+++ b/作業/unit12/shortestPath_2.dat
@@ -0,0 +1,15 @@
+8
+1 2 1
+1 3 3
+2 3 1
+2 5 3
+2 4 5
+3 5 1
+3 6 4
+4 5 3
+4 7 8
+5 6 4
+5 7 7
+6 8 7 
+7 6 6
+7 8 2
diff --git a/作業/unit12/shortestPath_down_1.dat b/作業/unit12/shortestPath_down_1.dat
new file mode 100644
index 0000000..998ac01
--- /dev/null
+++ b/作業/unit12/shortestPath_down_1.dat
@@ -0,0 +1,7 @@
+0
+4 0
+6 1 0
+6 0 2 0
+0 0 6 0 0
+0 0 4 5 1 0
+0 0 0 0 6 8 0
diff --git a/作業/unit12/shortestPath_down_2.dat b/作業/unit12/shortestPath_down_2.dat
new file mode 100644
index 0000000..f76d854
--- /dev/null
+++ b/作業/unit12/shortestPath_down_2.dat
@@ -0,0 +1,9 @@
+0 
+1 0 
+0 1 0 
+0 0 1 0 
+0 0 1 0 0 
+0 0 0 1 0 0 
+0 0 0 1 0 0 0 
+0 0 0 0 1 0 1 0  
+0 0 0 1 1 0 0 0 0 
\ No newline at end of file
diff --git a/作業/unit12/shortestPath_matrix.dat b/作業/unit12/shortestPath_matrix.dat
new file mode 100644
index 0000000..8be19ea
--- /dev/null
+++ b/作業/unit12/shortestPath_matrix.dat
@@ -0,0 +1,7 @@
+0 4 6 6 0 0 0
+4 0 1 0 7 0 0
+6 1 0 2 6 4 0
+6 0 2 0 0 5 0
+0 0 6 0 0 1 6
+0 0 4 5 1 0 8
+0 0 0 0 6 8 0
diff --git a/作業/unit12/shortestPath_up_1.dat b/作業/unit12/shortestPath_up_1.dat
new file mode 100644
index 0000000..dcb930a
--- /dev/null
+++ b/作業/unit12/shortestPath_up_1.dat
@@ -0,0 +1,7 @@
+0 4 6 6 0 0 0 
+  0 1 0 7 0 0 
+    0 2 6 4 0 
+      0 0 5 0 
+        0 1 6 
+          0 8 
+            0 
\ No newline at end of file
diff --git a/作業/unit12/shortestPath_up_2.dat b/作業/unit12/shortestPath_up_2.dat
new file mode 100644
index 0000000..1bf3d6e
--- /dev/null
+++ b/作業/unit12/shortestPath_up_2.dat
@@ -0,0 +1,10 @@
+0 1 1 0 0 0 0 0 0 0
+  0 0 1 1 0 0 0 0 0
+    0 0 0 1 1 0 0 0
+      0 0 0 0 1 0 0
+        0 0 0 1 0 0
+          0 0 0 1 0
+            0 0 1 0
+              0 0 1
+                0 1
+                  0
\ No newline at end of file
diff --git a/作業/unit12/up_1.dat b/作業/unit12/up_1.dat
new file mode 100644
index 0000000..d8c2c96
--- /dev/null
+++ b/作業/unit12/up_1.dat
@@ -0,0 +1,9 @@
+0 1 0 0 0 0 0 0 0 
+  0 1 0 0 0 0 0 0 
+    0 1 1 0 0 0 0 
+      0 0 1 1 0 1 
+        0 0 0 1 1 
+          0 0 0 0 
+            0 1 0 
+              0 0 
+                0
\ No newline at end of file
diff --git a/作業/unit12/up_2.dat b/作業/unit12/up_2.dat
new file mode 100644
index 0000000..1bf3d6e
--- /dev/null
+++ b/作業/unit12/up_2.dat
@@ -0,0 +1,10 @@
+0 1 1 0 0 0 0 0 0 0
+  0 0 1 1 0 0 0 0 0
+    0 0 0 1 1 0 0 0
+      0 0 0 0 1 0 0
+        0 0 0 1 0 0
+          0 0 0 1 0
+            0 0 1 0
+              0 0 1
+                0 1
+                  0
\ No newline at end of file
diff --git a/作業/unit13/quicksort.cpp b/作業/unit13/quicksort.cpp
new file mode 100644
index 0000000..16928f9
--- /dev/null
+++ b/作業/unit13/quicksort.cpp
@@ -0,0 +1,74 @@
+/* file name: quickSort.c */
+/* �ֳt�Ƨ� */
+
+#include <stdio.h>
+void quickSort(int[], int, int, int);
+void printDashLine(void);
+
+int main()
+{
+    int data[20];
+    int size = 0, i;
+    printf("\n�п�J���(��J 0 ���ܵ���): ");
+    /* �n�D��J�Ʀr�����J�Ʀr�� 0 */
+    do {
+        scanf("%d", &data[size]);
+    } while(data[size++] != 0);
+    
+    printDashLine();
+    quickSort(data, 0, size-2, size);
+    printDashLine();
+    
+    printf("�Ѥp�ܤj�Ƨǫ᪺���: ");
+    for (i = 0; i < size-1; i++)
+        printf("%d  ", data[i]);
+    printf("\n");
+
+    return 0;
+}
+
+void quickSort(int data[], int left, int right, int size)
+{
+    /* left �P right ���O�����ƧǸ�ƨ�� */
+    int lbase, rbase, temp, i;
+    if (left < right) {
+        lbase = left+1;
+        while(data[lbase] < data[left])
+            lbase++;
+        rbase = right;
+        while(data[rbase] > data[left])
+            rbase--;
+        
+        /* �Ylbase�p��rbase�A�h���ƹ�� */
+        while (lbase < rbase) {
+            temp = data[lbase];
+            data[lbase] = data[rbase];
+            data[rbase] = temp;
+            lbase++;
+            while(data[lbase] < data[left])
+                lbase++;
+            rbase--;
+            while (data[rbase] > data[left])
+                rbase--;
+        }
+        
+        /* ����lbase�j��rbase�A�hrbase����ƻP�Ĥ@����� */
+        temp = data[left];
+        data[left] = data[rbase];
+        data[rbase] = temp;
+        printf("Processing: ");
+        for (i = 0; i < size-1; i++)
+            printf("%3d  ", data[i]);
+        printf("\n");
+        quickSort(data, left, rbase-1, size);
+        quickSort(data, rbase+1, right, size);
+    }
+}
+
+void printDashLine()
+{
+    for(int i = 0; i < 62; i++)
+        printf("-");
+    printf("\n");
+}
+
diff --git a/作業/unit13/quicksort.exe b/作業/unit13/quicksort.exe
new file mode 100644
index 0000000..b805ae4
Binary files /dev/null and b/作業/unit13/quicksort.exe differ
diff --git a/作業/unit13/quicksort_v2.cpp b/作業/unit13/quicksort_v2.cpp
new file mode 100644
index 0000000..80ba3e4
--- /dev/null
+++ b/作業/unit13/quicksort_v2.cpp
@@ -0,0 +1,68 @@
+/* file name: quickSort.c */
+/* �ֳt�Ƨ� - �Ѥj��p */
+#include <stdio.h>
+void quickSort(int[], int, int, int);
+void printDashLine(void);
+int main()
+{
+    int data[20];
+    int size = 0, i;
+    printf("\n�п�J���(��J 0 ���ܵ���): ");
+    /* �n�D��J�Ʀr�����J�Ʀr�� 0 */
+    do {
+        scanf("%d", &data[size]);
+    } while(data[size++] != 0);
+    
+    printDashLine();
+    quickSort(data, 0, size-2, size);
+    printDashLine();
+    
+    printf("�Ѥj�ܤp�Ƨǫ᪺���: ");  // �קﴣ�ܤ�r
+    for (i = 0; i < size-1; i++)
+        printf("%d  ", data[i]);
+    printf("\n");
+    return 0;
+}
+void quickSort(int data[], int left, int right, int size)
+{
+    /* left �P right ���O�����ƧǸ�ƨ�� */
+    int lbase, rbase, temp, i;
+    if (left < right) {
+        lbase = left+1;
+        while(data[lbase] > data[left])  // �ק����Ÿ�
+            lbase++;
+        rbase = right;
+        while(data[rbase] < data[left])  // �ק����Ÿ�
+            rbase--;
+        
+        /* �Ylbase�p��rbase�A�h���ƹ�� */
+        while (lbase < rbase) {
+            temp = data[lbase];
+            data[lbase] = data[rbase];
+            data[rbase] = temp;
+            lbase++;
+            while(data[lbase] > data[left])  // �ק����Ÿ�
+                lbase++;
+            rbase--;
+            while (data[rbase] < data[left])  // �ק����Ÿ�
+                rbase--;
+        }
+        
+        /* ����lbase�j��rbase�A�hrbase����ƻP�Ĥ@����� */
+        temp = data[left];
+        data[left] = data[rbase];
+        data[rbase] = temp;
+        printf("�ƧǹL�{: ");
+        for (i = 0; i < size-1; i++)
+            printf("%3d  ", data[i]);
+        printf("\n");
+        quickSort(data, left, rbase-1, size);
+        quickSort(data, rbase+1, right, size);
+    }
+}
+void printDashLine()
+{
+    for(int i = 0; i < 62; i++)
+        printf("-");
+    printf("\n");
+}
diff --git a/作業/unit13/quicksort_v2.exe b/作業/unit13/quicksort_v2.exe
new file mode 100644
index 0000000..2ff9314
Binary files /dev/null and b/作業/unit13/quicksort_v2.exe differ
diff --git a/作業/unit2/DS2/DS2.zip b/作業/unit2/DS2.zip
similarity index 100%
rename from 作業/unit2/DS2/DS2.zip
rename to 作業/unit2/DS2.zip
diff --git a/作業/unit2/DS2/DS2.c b/作業/unit2/DS2/DS2.c
index c82bf2b..0f843e5 100644
--- a/作業/unit2/DS2/DS2.c
+++ b/作業/unit2/DS2/DS2.c
@@ -269,9 +269,9 @@ int main() {
 
 // 1x^3-2x^2-1x^1+2x^0  
 // 1x^5-1x^3-1x^2-1x^1+1x^0
-// 1x^2-100x^0 
-// 1x^2+100x^0
+// 1x^2-100x^0 1x^1+100x^0
 // 3x^4+9x^3-198x^2+156x^1+360x^0
+// 1x^3+1x^0
 
     int facF[30], facL[30], root[60], ans[60] ,new_ans[8];
     find_factor(A, facF, facL, len, &countF, &countL);
diff --git a/作業/unit2/DS2/DS2.exe b/作業/unit2/DS2/DS2.exe
index ea5f7c1..26eec09 100644
Binary files a/作業/unit2/DS2/DS2.exe and b/作業/unit2/DS2/DS2.exe differ
diff --git a/作業/unit2/DS2/DS2_usingLinkedlist.c b/作業/unit2/DS2/DS2_usingLinkedlist.c
new file mode 100644
index 0000000..c2aac9c
--- /dev/null
+++ b/作業/unit2/DS2/DS2_usingLinkedlist.c
@@ -0,0 +1,196 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#include <string.h>
+#include <ctype.h>
+
+typedef struct node {
+    int coef;
+    int exp;
+    struct node* rlink;
+    struct node* llink;
+} node;
+node *head, *tail, *current, *prev, *temp;
+
+void init_f() {
+    head = (node *)malloc(sizeof(node));
+    tail = (node *)malloc(sizeof(node));
+    head->rlink = tail;
+    tail->llink = head;
+}
+
+void read_poly(char str[] ){
+	int argCount ;
+	while (1) {
+
+    	node* newNode = (node*)malloc(sizeof(node));
+    	
+        argCount = sscanf(str, "%dx^%d%s", &newNode->coef, &newNode->exp, str);
+        
+        if (argCount >= 2) {  // ���\Ū���Y�ƩM����
+        
+            newNode->llink = tail->llink;  
+		    newNode->rlink = tail;         
+		    tail->llink->rlink = newNode;  
+		    tail->llink = newNode;
+
+            if (argCount == 2) {
+				break ;
+			}
+				
+        } else {
+        	if(!isdigit(newNode->coef)){
+        		newNode->exp = 0;
+        		
+				newNode->llink = tail->llink;  
+			    newNode->rlink = tail;         
+			    tail->llink->rlink = newNode;  
+			    tail->llink = newNode;
+			    
+			    break ;
+			    
+			}else{
+//				printf("newNode->coef = %d\n",newNode->coef);
+//				printf("isdigit(newNode->coef) = %d",isdigit(newNode->coef));
+				
+				free(newNode);
+            	break ;
+			}
+            
+        }
+	}
+}
+
+void clear_node(){
+	 // ����O����
+    current = head->rlink;
+    while (current != tail) {
+        temp = current;
+        current = current->rlink;
+        free(temp);
+    }
+    free(head);
+    free(tail);
+}
+
+
+void show(int p[], int n, int mode){
+	int i;
+	if(mode == 0){
+		printf("\n��{��p(x)= ");
+		current = head->rlink;
+		while (current != tail) {
+			if(abs(current->coef)>1){
+				printf("%s%d", current->coef > 1? "":"\b",current->coef);
+			}else if(current->coef == -1){
+				printf("%s", current->exp == 0? "\b-1":"\b-");
+			}
+			switch(current->exp){
+				case 0: 
+					if(current->coef == 1 ) printf("1+");
+					else printf("+");
+					break;
+				case 1:
+					printf("x+");
+					break;
+				default:
+					printf("x^%d+",current->exp);
+			}
+	        current = current->rlink;
+	    }
+	    printf("\b ");		
+	    
+	}else { /* mode==1�A��ܩұo�� */ 
+		for (i = 0; i < n; i++) printf("%d�B",p[i]);
+		if (n > 0) printf("\b\b  ");
+	}
+	
+}
+
+int findRoot(int q[]) /* ��ڡA�ұo�Ѧs�Jq[]�A�^�Ǯڪ��Ӽ� */ 
+{
+	int r, c = 0, i, j, k, sum;
+	int sign[2] = {1,-1};
+	
+	current = tail->llink;
+	r = abs(current->coef);				/* ���X�̧C�������Y�� */
+	
+	if (current->exp != 0) { /* �̧C���������� >= 1�A�h0���i��� */ 
+		if ((i = current->exp) > 0) q[c++] = 0;	/* �̧C���������Ƴ]��i */
+		current = head->rlink;
+		while(current!=tail){
+			current->exp -= i; /* �Ҧ����������ƴ�hi */ 
+			current = current->rlink;
+		}
+	}
+	
+	
+//	r = abs(p[2*p[0]]);				/* ���X�̧C�������Y�� */
+
+	for (i = 1; i <= r; i++) {		/* �Ҽ{��㰣r���]��i�A���`�N���t�� */ 
+		if (r%i != 0) continue;		/* ����㰣r��i�N���L�A�~��Ҽ{�U�@��i */ 
+		
+		for (j = 0; j < 2; j++) {	/* j��0�A�N���Ҽ{+i�����ҡFj��1�A�N���Ҽ{-i�����p */
+			for (sum = 0, current = head->rlink ; current!= tail ; current = current->rlink)	/* �p��C�@�������G��(�Y��*x^����)�ò֥[��sum���� */ 
+				sum += current->coef *(int)(pow(sign[j]*i,current->exp));
+			if (sum == 0) q[c++] = sign[j]*i;  /* bingo! �o�{�X�G���󪺾�ƮڡA�N��g�Jq�}�C */ 
+		}
+	}
+	
+	return c;
+}
+
+
+int main() {
+    char str[100];
+    int poly_num , *q ,c , high;
+    init_f();
+
+    printf("\n*** �Ѧh��������Ʈ� ***\n\n��J�h���� ==> ");
+    
+    if (fgets(str, sizeof(str), stdin) == NULL) {
+        printf("��J���~�I\n");
+        return 1;
+    }
+
+
+/*	
+		1x^2-100x^0
+		1x^3-2x^2-1x^1+2x^0
+		1x^3-7x^2+4x^1+12x^0
+		1x^4+3x^3-66x^2+52x^1+120x^0
+		3x^4+9x^3-198x^2+156x^1+360x^0
+		1x^2-1x^1
+		2x^ 3 -201 x^2+ 97 x^1 +300
+		2x^12-195x^11-500x^10
+		6x^4 - 1x^3 -25x^2 + 4x^1 + 4 
+		1x^5-1x^3-1x^2-1x^1+1x^0
+		1x^5+1x^3+1x^2+1x^1+1x^0
+		1x^3+1x^0
+*/ 
+	
+    read_poly(str);
+    
+    current = head->rlink;
+	high= current->exp;
+    
+	show(q,c,0);
+	
+	q = (int *)malloc((high + 1) *sizeof(int)); /* p[1]�����̰����������ơA�̦��ȳЫب��������Ŷ����}�C�s��ҨD�o����Ʈ� */ 
+	
+	c = findRoot(q);
+	
+	if (c > 0) {
+		printf("\n\n�ѱo��Ʈڬ��G");
+		show(q,c,1);  
+	}
+	else
+		printf("\n\n��Ʈڤ��s�b\n");
+		
+    
+    
+	clear_node();
+   
+
+    return 0;
+}
diff --git a/作業/unit2/Makefile.win b/作業/unit2/Makefile.win
new file mode 100644
index 0000000..b8ef98a
--- /dev/null
+++ b/作業/unit2/Makefile.win
@@ -0,0 +1,28 @@
+# Project: Project1
+# Makefile created by Dev-C++ 5.11
+
+CPP      = g++.exe
+CC       = gcc.exe
+WINDRES  = windres.exe
+OBJ      = poly-integer-root.o
+LINKOBJ  = poly-integer-root.o
+LIBS     = -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib" -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/lib" -static-libgcc
+INCS     = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include"
+CXXINCS  = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include/c++"
+BIN      = Project1.exe
+CXXFLAGS = $(CXXINCS) 
+CFLAGS   = $(INCS) 
+RM       = rm.exe -f
+
+.PHONY: all all-before all-after clean clean-custom
+
+all: all-before $(BIN) all-after
+
+clean: clean-custom
+	${RM} $(OBJ) $(BIN)
+
+$(BIN): $(OBJ)
+	$(CC) $(LINKOBJ) -o $(BIN) $(LIBS)
+
+poly-integer-root.o: poly-integer-root.c
+	$(CC) -c poly-integer-root.c -o poly-integer-root.o $(CFLAGS)
diff --git a/作業/unit2/NODUMMY.c b/作業/unit2/NODUMMY.c
new file mode 100644
index 0000000..3ca5721
--- /dev/null
+++ b/作業/unit2/NODUMMY.c
@@ -0,0 +1,90 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void output_P(int P[]);
+void Padd(int A[], int B[], int C[],int lenA,int lenB);
+
+void output_P(int P[]) {
+	int i;
+    for(i=1;i<P[0]*2;i++){
+		printf("%d^%d ",P[i+1],P[i]);
+		i++;
+	}
+}
+
+void Padd(int A[], int B[], int C[],int lenA,int lenB) {
+    int i = 1 , j=1 , k=1 ,count=0;
+    
+    while(i<lenA && j<lenB){//���O���A�MB������ 
+    	if(A[i]>B[j]){
+    		C[k++] = A[i++];
+    		C[k++] = A[i++];
+    		count++;
+		}
+    	if(A[i]<B[j]){
+    		C[k++] = B[j++];
+    		C[k++] = B[j++];
+    		count++;
+		}
+		if(A[i]==B[j]){
+    		C[k++] = B[j++];
+    		i++;
+    		C[k++] = B[j++] + A[i++];
+    		count++;
+		}C[0]=count;
+	}
+	
+//	���� 
+//	printf("\nA = (");
+//    for(i=0;i<lenA;i++){
+////    	printf("A[%d]=%d ,",i,A[i]);
+//    	printf("%d ",A[i]);
+//	}
+//	printf(")\nB = (");
+//    for(i=0;i<lenB;i++){
+////    	printf("B[%d]=%d ,",i,B[i]);
+//    	printf("%d ",B[i]);
+//	}
+//	printf(")\nC = (");
+//	for(i=0;i<count*2+1;i++){
+////    	printf("C[%d]=%d ,",i,C[i]);
+//    	printf("%d ",C[i]);
+//	}printf(")");
+	
+//	����n��	
+//	printf("\nA�h������%d�Ӥ���\n",A[0]);
+//    for(i=1;i<A[0]*2;i++){
+//		printf("%d^%d ",A[i+1],A[i]);
+//		i++;
+//	}
+//	printf("\nB�h������%d�Ӥ���\n",B[0]);
+//    for(i=1;i<B[0]*2;i++){
+//		printf("%d^%d ",B[i+1],B[i]);
+//		i++;
+//	}
+//	printf("\nC�h������%d�Ӥ���\n",C[0]);
+//    for(i=1;i<C[0]*2;i++){
+//		printf("%d^%d ",C[i+1],C[i]);
+//		i++;
+//	}
+	
+}
+
+int main() {
+    int A[] = { 5, 6, 6, 4, 5, 2, 3, 1, 3, 0, 2 };
+    int B[] = { 4, 4, 8, 3, 6, 2, 2, 0, 1 };
+    int C[13] = { 0 };
+	int lenA = sizeof A / sizeof A[0];
+	int lenB = sizeof B / sizeof B[0];
+	
+    Padd(A, B, C, lenA, lenB);
+    
+    printf("\nA�h������%d�Ӥ���\nA = ( ",A[0]);
+	output_P(A);
+	printf(")\nB�h������%d�Ӥ���\nB = ( ",B[0]);
+	output_P(B);
+	printf(")\nC�h������%d�Ӥ���\nC = ( ",C[0]);
+	output_P(C);
+	printf(")");
+    return 0;
+}
diff --git a/作業/unit2/NODUMMY.o b/作業/unit2/NODUMMY.o
new file mode 100644
index 0000000..0d70a3b
Binary files /dev/null and b/作業/unit2/NODUMMY.o differ
diff --git a/作業/unit2/Project1.dev b/作業/unit2/Project1.dev
new file mode 100644
index 0000000..30b6c78
--- /dev/null
+++ b/作業/unit2/Project1.dev
@@ -0,0 +1,62 @@
+[Project]
+FileName=Project1.dev
+Name=Project1
+Type=1
+Ver=2
+ObjFiles=
+Includes=
+Libs=
+PrivateResource=
+ResourceIncludes=
+MakeIncludes=
+Compiler=
+CppCompiler=
+Linker=
+IsCpp=0
+Icon=
+ExeOutput=
+ObjectOutput=
+LogOutput=
+LogOutputEnabled=0
+OverrideOutput=0
+OverrideOutputName=
+HostApplication=
+UseCustomMakefile=0
+CustomMakefile=
+CommandLine=
+Folders=
+IncludeVersionInfo=0
+SupportXPThemes=0
+CompilerSet=0
+CompilerSettings=0000000000000000000000000
+UnitCount=1
+
+[VersionInfo]
+Major=1
+Minor=0
+Release=0
+Build=0
+LanguageID=1033
+CharsetID=1252
+CompanyName=
+FileVersion=
+FileDescription=Developed using the Dev-C++ IDE
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=
+AutoIncBuildNr=0
+SyncProduct=1
+
+[Unit1]
+FileName=poly-integer-root.c
+CompileCpp=0
+Folder=
+Compile=1
+Link=1
+Priority=1000
+OverrideBuildCmd=0
+BuildCmd=
+
diff --git a/作業/unit2/Project1.exe b/作業/unit2/Project1.exe
new file mode 100644
index 0000000..e13aeca
Binary files /dev/null and b/作業/unit2/Project1.exe differ
diff --git a/作業/unit2/Project1.layout b/作業/unit2/Project1.layout
new file mode 100644
index 0000000..ac247ea
--- /dev/null
+++ b/作業/unit2/Project1.layout
@@ -0,0 +1,18 @@
+[Editor_0]
+CursorCol=14
+CursorRow=249
+TopLine=148
+LeftChar=1
+[Editor_1]
+CursorCol=1
+CursorRow=1
+TopLine=1
+LeftChar=1
+[Editors]
+Order=0
+Focused=0
+[Editor_2]
+CursorCol=1
+CursorRow=1
+TopLine=1
+LeftChar=1
diff --git a/作業/unit2/Untitled1.c b/作業/unit2/Untitled1.c
new file mode 100644
index 0000000..199c86b
--- /dev/null
+++ b/作業/unit2/Untitled1.c
@@ -0,0 +1,11 @@
+#include <stdio.h>
+
+int main(){
+	int A[10]={0};
+	int *B=(int *)malloc(10*sizeof(int));
+	printf("A=%d\n",sizeof(A)); 
+	printf("B=%d\n",sizeof(B)); 
+	B=&A;
+	printf("B=%d\n",sizeof(B)); 
+	return 0;
+} 
diff --git a/作業/unit2/Untitled1.o b/作業/unit2/Untitled1.o
new file mode 100644
index 0000000..54e9a9e
Binary files /dev/null and b/作業/unit2/Untitled1.o differ
diff --git a/作業/unit2/claude.c b/作業/unit2/claude.c
new file mode 100644
index 0000000..cfef293
--- /dev/null
+++ b/作業/unit2/claude.c
@@ -0,0 +1,94 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+void count_root(int arrR[], int arrL[], int ans[], int countF, int countL, int *len_ans) {
+    int i, j, k = 0;
+    for (i = 0; i < countF; i++) {
+        for (j = 0; j < countL; j++) {
+            if (arrL[j] != 0 && arrR[i] != 0 && arrL[j] % arrR[i] == 0) {
+                ans[k++] = arrL[j] / arrR[i];
+            }
+        }
+    }
+    *len_ans = k;
+}
+
+void plus_root_negative(int arr[], int *len) {
+    int i, new_len = *len * 2;
+    for (i = 0; i < *len; i++) {
+        arr[*len + i] = -arr[i];
+    }
+    *len = new_len;
+}
+
+void find_factor(int num, int fac[], int *count) {
+    int i, j = 0;
+    for (i = 1; i <= sqrt(abs(num)); i++) {
+        if (num % i == 0) {
+            fac[j++] = i;
+            if (i != num / i) {
+                fac[j++] = num / i;
+            }
+        }
+    }
+    *count = j;
+}
+
+double evaluate_polynomial(int A[], int len, double x) {
+    double result = 0;
+    int i;
+    for (i = 0; i < len; i += 2) {
+        result += A[i] * pow(x, A[i+1]);
+    }
+    return result;
+}
+
+void Substitute(int len_root, int arr[], int ans[], int A[], int len_A, int *len_ans) {
+    int i, j = 0;
+    double result;
+    for (i = 0; i < len_root; i++) {
+        result = evaluate_polynomial(A, len_A, arr[i]);
+        if (fabs(result) < 1e-10) {  // �ϥΤp���H�ȨӳB�z�B�I�~�t
+            ans[j++] = arr[i];
+        }
+    }
+    *len_ans = j;
+}
+
+int main() {
+    int i, len, countF, countL, len_root = 0, len_ans = 0;
+    int A[] = { 2, 2, 1, 0, -100};  // x^3 - 2x^2 - x + 2 
+    int facF[100], facL[100], root[200], ans[100];
+    len = sizeof(A) / sizeof(A[0]);
+    
+    find_factor(abs(A[0]), facF, &countF);
+    find_factor(abs(A[len-2]), facL, &countL);
+    
+    printf("�̰����趵�]�Ƭ�: ");
+    for (i = 0; i < countF; i++) {
+        printf("%d ", facF[i]);
+    }
+    printf("\n�`�ƶ��]�Ƭ�: ");
+    for (i = 0; i < countL; i++) {
+        printf("%d ", facL[i]);
+    }
+    printf("\n");
+    
+    count_root(facF, facL, root, countF, countL, &len_root);
+    plus_root_negative(root, &len_root);
+    
+    printf("�i�઺�ڡG\n");
+    for (i = 0; i < len_root; i++) {
+        printf("root[%d] = %d\n", i, root[i]);
+    }
+    
+    Substitute(len_root, root, ans, A, len, &len_ans);
+    
+    printf("�h�������ڡG\n");
+    for (i = 0; i < len_ans; i++) {
+        printf("x = %d\n", ans[i]);
+    }
+    
+    return 0;
+}
diff --git a/作業/unit2/claude.exe b/作業/unit2/claude.exe
new file mode 100644
index 0000000..8556cb4
Binary files /dev/null and b/作業/unit2/claude.exe differ
diff --git a/作業/unit2/claude.o b/作業/unit2/claude.o
new file mode 100644
index 0000000..a7c7a8b
Binary files /dev/null and b/作業/unit2/claude.o differ
diff --git a/作業/unit2/main.c b/作業/unit2/main.c
new file mode 100644
index 0000000..4973ad2
--- /dev/null
+++ b/作業/unit2/main.c
@@ -0,0 +1,59 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+//#define f(x) (x*x*x-2*x*x-x+2)
+//#define f(x) (x*x-100)
+#define f(x) (3*x*x*x*x+9*x*x*x-198*x*x+156*x+360)
+
+void binary_search ( int *ans){
+	int count = 1000 , i=0;
+	double mid , lower=-15 , upper=20;
+	while ((f(mid)) != 0 && i < count ) {
+	    mid = (lower + upper) / 2.0;  
+
+	    printf("#%d\t[%f,%f]\t��=%f\n",i+1,lower,upper,mid);
+	    
+	    if (fabs(f(mid)) == 0) {
+        	break;
+        }
+        	
+	    i++;
+	    if ( f(mid) * f(lower) < 0) {
+	    	upper = mid;
+	    } else {
+	    	lower = mid;
+	    }
+	}*ans = mid;
+}
+
+void Exhaustive(int a, int b, int *ans, int *count) {
+    *count = 0;
+    int i;
+    for (i = a; i <= b; i++) {
+        if (f(i) == 0) {
+            ans[*count] = i;
+            (*count)++;
+        }
+    }
+}
+
+int main() {
+
+	int i , x , lower=-200 , upper=200 ;
+	int ans[10];
+	int *count;
+	
+	Exhaustive(lower,upper,ans,&count);
+	if (count > 0) {
+		printf("*** �Ѧh��������Ʈ� ***\n");
+		printf("\n��{��p(x)= 3^4+9x^3-198x^2+156+360\n");
+        printf("\n�ѱo��Ʈڬ�");
+        for (i = 0; i < count; i++) {
+            printf(" %d ", ans[i]);
+        }
+    } else {
+        printf("�b���w�d�򤺨S������ƸѡC\n");
+    }
+
+	return 0;
+}
diff --git a/作業/unit2/main.o b/作業/unit2/main.o
new file mode 100644
index 0000000..876b89e
Binary files /dev/null and b/作業/unit2/main.o differ
diff --git a/作業/unit2/oddMagic.c b/作業/unit2/oddMagic.c
new file mode 100644
index 0000000..926f51c
--- /dev/null
+++ b/作業/unit2/oddMagic.c
@@ -0,0 +1,58 @@
+#include <stdio.h>
+#include <stdlib.h> 
+#define MAX 15
+
+int Square[MAX][MAX];
+int N;
+
+int main(){
+	int i , j ,row=0 , col=0 , num=2;
+	do {
+		printf("\nEnter odd matrix size : ");
+		scanf("%d",&N);
+		
+		if( N % 2 == 0 || N <= 0 || N > 15){
+			printf("should be > 0 and 15 odd number");
+		}else{
+			break;
+		}
+	}while(1);
+	
+	while(1){
+		Square[0][(N-1)/2] = 1;
+		col=(N-1)/2;
+		if((row-1)<0 && (col+1<N)){
+			row = N-1;  // �p�G��ƶW�X�W��ɡA�^��̫�@��
+			col++;
+			Square[row--][col--] = num;
+		}else if ((row-1)>0 && (col+1<N)){
+//			row--;
+			col = 4;  // �p�G�C�ƶW�X����ɡA�^��Ĥ@�C
+			Square[row--][co--] = num;
+		}else if((row-1)>0 && (col+1<N)){
+			row = row-1;  // �p�G��ƶW�X�W��ɤΥk��ɡA�^��U�@��
+			Square[row--][col--] = num;
+		}
+		
+		if(Square[row][col]==0){
+			Square[row--][col--] = num;
+		}
+		
+		printf("num=%d ,Square[%d][%d]=%d\n",num ,row,col,Square[row][col]);
+//		row++, col++;
+		num++;
+		
+		
+		if(num>N*N)
+			break;
+	}
+
+//	for(i=0;i<N;i++){
+//		for(j=0;j<N;j++){
+//			printf("%d\t",Square[i][j]);
+//		}printf("\n");
+//	}
+		
+	
+	return 0 ;
+}
diff --git a/作業/unit2/oddMagic.o b/作業/unit2/oddMagic.o
new file mode 100644
index 0000000..e931de9
Binary files /dev/null and b/作業/unit2/oddMagic.o differ
diff --git a/作業/unit2/poly-integer-root.c b/作業/unit2/poly-integer-root.c
new file mode 100644
index 0000000..6d14123
--- /dev/null
+++ b/作業/unit2/poly-integer-root.c
@@ -0,0 +1,320 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#include <string.h>
+
+#define MAX 10
+
+// �x�s�C�@�������c
+struct Term {
+    int coefficient;  // �Y��
+    int exponent;     // ����
+};
+
+//�p��i�઺�� 
+void count_root(int arrR[],int arrL[],int ans[],int countF,int countL ,int *len_ans){
+  int i , j ,k=0;
+  for(i=0;i<countF;i++){
+    for(j=0;j<countL;j++){
+      if((arrL[j]%arrR[i])==0){
+        ans[k++] = arrL[j]/arrR[i];
+      }	
+    }		
+  }*len_ans =k;
+}
+
+//�N�̰����Y�ƻP�`�ƪ��]�ƥ[�J�t�� 
+void plus_root_negative(int arr[],int *len){
+  int i , j=0;
+  for(i=0;i<*len;i++){
+    arr[*len+j]=-(arr[i]);
+    j++;
+  }*len=*len+j;
+}
+
+//��̰����Y�ƻP�`�ƪ��]�� 
+void find_factor(int P[], int facF[], int facL[], int len, int *count1, int *count2) {
+    int i, j = 0;
+    for (i = 1; i <= abs(ceil(P[2] / 2)); i++) {  
+        if (abs(P[2]) % i == 0) {
+            facF[j++] = i;
+        }
+    }
+    facF[j++] = fabs(P[2]);  // �]�t P[2] ����
+    *count1 = j;  // �]�w��쪺�]�ƭӼ�
+
+    j = 0;
+    for (i = 1 ; i <= abs(ceil(P[len-1] / 2)); i++) {  
+        if (abs(P[len-1]) % i == 0) {
+            facL[j++] = i;
+        }
+    }
+    facL[j++] = fabs(P[len-1]);  // �]�t P[len] ����
+    *count2 = j;  // �]�w��쪺�]�ƭӼ�
+}
+
+//��ڥN�J��{��
+int evaluate_polynomial(int A[], int len, int x) {
+    int result = 0;
+    int i;
+    for (i = 2; i < len; i += 2) {
+        result += A[i] * pow(x, A[i-1]);
+    }
+    return result;
+}
+
+//��ڥN�J��{�� �D���� 
+void Substitute(int len_root, int arr[], int ans[], int A[], int len_A, int *len_ans) {
+    int i, j = 0, result;
+    for (i = 0; i < len_root; i++) {
+        result = evaluate_polynomial(A, len_A, arr[i]);
+//        printf("x = %d, result = %d\n", arr[i], result);
+        if (result == 0) {
+            ans[j++] = arr[i];
+        }
+    }
+    *len_ans = j;
+}
+
+//�������ƪ����� 
+void remove_duplicates(int A[], int len, int new_A[], int *new_len) {
+    int i, j, k;
+    int is_duplicate;
+
+    *new_len = 0; // ��l�Ʒs���}�C���׬�0
+
+    // �M����l�}�C
+    for (i = 0; i < len; i++) {
+        is_duplicate = 0; // ���]���e�����S������
+
+        // �ˬd�O�_�b���G�}�C���X�{�L
+        for (j = 0; j < *new_len; j++) {
+            if (A[i] == new_A[j]) {
+                is_duplicate = 1; // �p�G�o�{���ơA�аO��1
+                break;
+            }
+        }
+
+        // �p�G�S�����ơA�N��[�J���G�}�C
+        if (!is_duplicate) {
+            new_A[*new_len] = A[i];
+            (*new_len)++; // ��s���G�}�C������
+        }
+    }
+}
+
+//��ܤ�{��
+void output(int *A,int len){
+  int i ,j,flag_Max=0,flag_x=0, flag_const=0 ;
+  printf("\n��{��p(x)= ");
+  //A[i]������ A[i+1]���Y��
+  //i�q1�}�l�� �@��Ū���@�ӫ��ƻP�Y�� 
+  //len��A[]������  
+  //flag_Max ���̰��������X��
+  //flag_x ��1�������X��	
+  //flag_const ���`�ƶ����X��	
+  
+  for(i=1;i<len;i++){
+  	if(A[i]==1){ //�Y���ƶ�=1 IJ�o�@�����X�� 
+  		flag_x=1; 
+	}else if(A[i]==0){ //�Y���ƶ�=0  IJ�o�`�ƶ��X��
+		flag_const=1;
+	}
+	
+     if(flag_Max==0){ //�Ĥ@�� 
+     	if( A[i]>1 && A[i+1]!=1){ //���Ƥj��1 �Y�Ƥ�����1 
+     		printf("%dx^%d",A[i+1],A[i]);
+		 }else if(A[i]>1 && A[i+1]==1){
+		 	printf("x^%d",A[i]); //���Ƥj��1 �Y�Ƶ���1 
+		 }else if(A[i]==1 && A[i+1]!=1){ //����=1 �Y�Ƥ�����1      
+		 	printf("%dx",A[i+1]);
+		 }else if(A[i]==0 && A[i+1]!=1){ //����=0 �Y�Ƥ�����1 
+		 	printf("%d",A[i+1]);
+		 }else if(A[i]==1 && A[i+1]==1){ //����=1 �Y��=1 
+		 	printf("x");
+		 }else if(A[i]==1 && A[i+1]==-1){ //����=1 �Y��=-1 
+		 	printf("-x");
+		 }flag_Max = 1; //���������X��=1
+  	}else if(flag_x == 1 && flag_const==0){// x�@����
+  		if(A[i+1]>0){ // x�@�������� 
+  			if(A[i+1]==1){
+  				printf("+x",A[i+1]); 
+			}else{
+				printf("+%dx",A[i+1]); 
+			}	 
+		}else if(A[i+1]<0){ //x�@�������t 
+			if(A[i+1]==-1){
+				printf("-x",A[i+1]);
+			}else{
+				printf("%dx",A[i+1]);
+			}	
+		} 
+  	}else if(flag_const==1){  // �`�ƶ�
+  		if(A[i+1]>0){ //�`�ƶ�>0 
+			printf("+%d",A[i+1]);
+		}else if(A[i+1]<0) { //�`�ƶ�<0  
+			printf("%d",A[i+1]);
+		}
+	}else if(flag_Max==1 && flag_x==0 && flag_const==0) { //�h�������������� 
+		if(A[i+1]>0){ //�Y��>1
+			if(A[i+1]==1){ //�Y��=1 
+  				printf("x^%d",A[i]);
+			}else{ //�Y�Ƥ�����1  
+				printf("+%dx^%d",A[i+1],A[i]);
+			}
+		}else if(A[i+1]<0){ //�Y��<1
+			if(A[i+1]==-1){ //�Y��=-1 
+				printf("-x^%d",A[i]);
+			}else{ //�Y�Ƥ�����1   
+				printf("%dx^%d",A[i+1],A[i]);
+				}	
+			}	
+		}i++;
+	}
+	printf("\n");
+}
+
+int main() {
+    int i,j, len, countF, countL, len_root, len_ans ,len_new ;  
+    char input[100];
+    struct Term terms[MAX];
+    int term_count = 0;
+	printf("\n*** �Ѧh��������Ʈ� ***\n");
+
+    // 1. Ū����J
+    printf("\n�п�J�h�����G ");
+    fgets(input, sizeof(input), stdin);
+    input[strcspn(input, "\n")] = 0;  // ���������
+
+    // 2. �B�z�C�@��
+    char *ptr = input;
+    while (*ptr && term_count < MAX) {
+        int coef = 0, exp = 0;
+        int is_negative = 0;
+
+        // �ˬd�t��
+        if (*ptr == '-') {
+            is_negative = 1;
+            ptr++;
+        } else if (*ptr == '+') {
+            ptr++;
+        }
+
+        // ���L�ťզr��
+        while (isspace(*ptr)) ptr++;
+
+        // 3. �ѪR�C�@��
+        if (sscanf(ptr, "%dx^%d", &coef, &exp) == 2) {
+            // ���㪺 ax^b �Φ�
+            ptr = strchr(ptr, '^') + 1;
+        } else if (sscanf(ptr, "%dx", &coef) == 1) {
+            // ax �Φ��A���Ƭ�1
+            exp = 1;
+            ptr = strchr(ptr, 'x') + 1;
+        } else if (sscanf(ptr, "x^%d", &exp) == 1) {
+            // x^b �Φ��A�Y�Ƭ�1
+            coef = 1;
+            ptr = strchr(ptr, '^') + 1;
+        } else if (strncmp(ptr, "x", 1) == 0) {
+            // ��W�� x�A�Y�Ƭ�1�A���Ƭ�1
+            coef = 1;
+            exp = 1;
+            ptr++;
+        } else {
+            // ���]�O�`�ƶ�
+            sscanf(ptr, "%d", &coef);
+            exp = 0;
+            while (isdigit(*ptr)) ptr++;
+        }
+
+        // 4. �B�z�t��
+        if (is_negative) {
+            coef = -coef;
+        }
+
+        // 5. �x�s���G
+        terms[term_count].coefficient = coef;
+        terms[term_count].exponent = exp;
+        term_count++;
+
+        // ��X���e�����H���]�Ω�ոա^
+//        printf("�� %d: �Y�� = %d, ���� = %d\n", term_count, coef, exp);
+
+        // ���ʨ�U�@�� '+' �� '-' �Ÿ�
+        while (*ptr && *ptr != '+' && *ptr != '-') ptr++;
+    }
+
+//	int *A = (int*)malloc(((term_count*2)+1) * sizeof(int)) ;
+  len = ((term_count*2)+1);
+  int A[len];
+
+//	printf("term_count=%d\n",term_count);
+//	printf("((term_count*2)+1)=%d\n",((term_count*2)+1));
+//	printf("sizeof(A)=%d\n",sizeof(A));
+
+  A[0]=term_count;
+  for (i = 1 , j=0 ; i < term_count*2 ; i++ , j++ ){
+    A[i]= terms[j].exponent;
+    A[i+1]= terms[j].coefficient;
+//		printf("A[%d]=%d\n",i,terms[j].exponent);
+//		printf("A[%d]=%d\n",i+1,terms[j].coefficient);
+    i++;
+  }
+
+//	printf("A[]= ");
+//	for (i = 0; i < len; i++) {
+//		printf(" %d ",A[i]);
+//    }
+//    printf("\n");
+
+// 1x^3-2x^2-1x^1+2x^0  
+// 1x^5-1x^3-1x^2-1x^1+1x^0
+// 1x^2-100x^0 1x^1+100x^0
+// 3x^4+9x^3-198x^2+156x^1+360x^0
+
+    int facF[30], facL[30], root[60], ans[60] ,new_ans[8];
+    find_factor(A, facF, facL, len, &countF, &countL);
+
+//    printf("�̰����趵�]�Ƭ�: ");
+//    for (i = 0; i < countF; i++) {
+//        printf("%d ", facF[i]);
+//    }
+//    printf("\n�`�ƶ��]�Ƭ�: ");
+//    for (i = 0; i < countL; i++) {
+//        printf("%d ", facL[i]);
+//    }
+//    printf("\n");
+
+    count_root(facF, facL, root, countF, countL, &len_root);  
+    plus_root_negative(root, &len_root);
+
+//    printf("�i�઺�ڡG\n");
+//    for (i = 0; i < len_root; i++) {
+//        printf("root[%d] = %d\n", i, root[i]);
+//    }
+  
+  //��X�h����
+  output(A,len);
+  // �p��i�઺��
+  Substitute(len_root, root, ans, A, len, &len_ans); 
+
+  //�����h�l���� 
+  remove_duplicates(ans,len_ans,new_ans,&len_new); 
+
+  if(len_new==0){
+      printf("\n��Ʈڤ��s�b");
+      return 1 ;
+  }
+
+    if(len_new>0){
+    printf("\n�ѱo��Ʈڬ��G");
+        for (i = 0; i < len_new; i++) {
+            if(i<len_new-1) {
+            printf("%d�B",new_ans[i]);
+        }else if(i==len_new-1) {
+          printf("%d", new_ans[i]);
+          }
+        }
+    }
+    return 0;
+}
diff --git a/作業/unit2/poly-integer-root.exe b/作業/unit2/poly-integer-root.exe
new file mode 100644
index 0000000..bb58535
Binary files /dev/null and b/作業/unit2/poly-integer-root.exe differ
diff --git a/作業/unit2/poly-integer-root.o b/作業/unit2/poly-integer-root.o
new file mode 100644
index 0000000..0bcc132
Binary files /dev/null and b/作業/unit2/poly-integer-root.o differ
diff --git a/作業/unit2/polynominal.c b/作業/unit2/polynominal.c
new file mode 100644
index 0000000..05c2769
--- /dev/null
+++ b/作業/unit2/polynominal.c
@@ -0,0 +1,87 @@
+#include <stdio.h>
+#include <stdlib.h>
+#define DUMMY -1
+
+void output_P(int P[], int size);
+void Padd(int A[], int B[], int C[]);
+char compare(int a, int b);
+
+void output_P(int P[], int size) {
+    int i;
+    int first = 1;
+    for (i = 2; i < size; i += 2) {
+        if (P[i+1] != 0) {
+            if (!first) {
+                printf(" + ");
+            }
+            if (P[i] > 1) {
+                printf("%dx^%d", P[i+1], P[i]);
+            } else if (P[i] == 1) {
+                printf("%dx", P[i+1]);
+            } else {
+                printf("%d", P[i+1]);
+            }
+            first = 0;
+        }
+    }
+    if (first) {  // �p�G�h������0
+        printf("0");
+    }
+    printf("\n");
+}
+
+void Padd(int A[], int B[], int C[]) {
+    int i = 2, j = 2, k = 2;
+    int sizeA = A[1], sizeB = B[1];
+    while (i < sizeA * 2 + 2 || j < sizeB * 2 + 2) {
+        if (i >= sizeA * 2 + 2) {
+            C[k] = B[j];
+            C[k+1] = B[j+1];
+            j += 2;
+        } else if (j >= sizeB * 2 + 2) {
+            C[k] = A[i];
+            C[k+1] = A[i+1];
+            i += 2;
+        } else if (A[i] > B[j]) {
+            C[k] = A[i];
+            C[k+1] = A[i+1];
+            i += 2;
+        } else if (A[i] < B[j]) {
+            C[k] = B[j];
+            C[k+1] = B[j+1];
+            j += 2;
+        } else {
+            C[k] = A[i];
+            C[k+1] = A[i+1] + B[j+1];
+            if (C[k+1] == 0) {
+                k -= 2;  // �p�G�Y�Ƭ�0�A���K�[�o�@��
+            }
+            i += 2;
+            j += 2;
+        }
+        k += 2;
+    }
+    C[1] = (k - 2) / 2;
+    C[0] = DUMMY;
+    printf("A: ");
+    output_P(A, sizeA * 2 + 2);
+    printf("B: ");
+    output_P(B, sizeB * 2 + 2);
+    printf("C = A + B: ");
+    output_P(C, k);
+}
+
+char compare(int a, int b) {
+    if (a > b) return '>';
+    if (a < b) return '<';
+    return '=';
+}
+
+int main() {
+    int A[] = { DUMMY, 4, 4, 5, 3, 2, 2, 3, 0, 2 };
+    int B[] = { DUMMY, 3, 3, 6, 1, 5, 0, 1 };
+    int C[13] = { DUMMY };
+    
+    Padd(A, B, C);
+    return 0;
+}
diff --git a/作業/unit2/polynominal.o b/作業/unit2/polynominal.o
new file mode 100644
index 0000000..ab31197
Binary files /dev/null and b/作業/unit2/polynominal.o differ
diff --git a/作業/unit2/test.c b/作業/unit2/test.c
new file mode 100644
index 0000000..4b07c1a
--- /dev/null
+++ b/作業/unit2/test.c
@@ -0,0 +1,67 @@
+#include <stdio.h>
+#include <stdlib.h>
+#define MAX 15
+
+int Square[MAX][MAX];
+int N;
+
+void printSquare() {
+	int i ,j;
+    for (i = 0; i < N; i++) {
+        for (j = 0; j < N; j++) {
+            printf("%d\t", Square[i][j]);
+        }
+        printf("\n");
+    }
+}
+
+int main() {
+    int row, col, num, i ,j;
+
+    do {
+        printf("\n�п�J�_�Ƥ�}�j�p (1-15�������_��): ");
+        scanf("%d", &N);
+        
+        if (N % 2 == 0 || N <= 0 || N > 15) {
+            printf("��J���~�G�����O1-15�������_��\n");
+        } else {
+            break;
+        }
+    } while (1);
+
+    // ��l�Ƥ�}
+    for (i = 0; i < N; i++) {
+        for (j = 0; j < N; j++) {
+            Square[i][j] = 0;
+        }
+    }
+
+    row = 0;
+    col = N / 2;
+//    printf("col=%d\n", col);
+    num = 1;
+
+    while (num <= N * N) {
+        Square[row][col] = num;
+
+        // �ˬd�U�@�Ӧ�m
+        int nextRow = (row - 1 + N) % N;
+        int nextCol = (col + 1) % N;
+
+        if (Square[nextRow][nextCol] != 0) {
+            // �p�G�U�@�Ӧ�m�w�Q���ΡA�h���U����
+            row = (row + 1) % N;
+        } else {
+            // �_�h�A���ʨ�k�W������m
+            row = nextRow;
+            col = nextCol;
+        }
+
+        num++;
+    }
+
+    printf("\n%d x %d �]��}:\n\n", N, N);
+    printSquare();
+
+    return 0;
+}
diff --git a/作業/unit2/test.o b/作業/unit2/test.o
new file mode 100644
index 0000000..4396c70
Binary files /dev/null and b/作業/unit2/test.o differ
diff --git a/作業/unit3/DS3.cpp b/作業/unit3/DS3.cpp
new file mode 100644
index 0000000..e951a9d
--- /dev/null
+++ b/作業/unit3/DS3.cpp
@@ -0,0 +1,267 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <math.h>
+#include <ctype.h>
+#define MAX 100
+
+// === �����ܼƫŧi ===
+char input[MAX];
+char postfix[MAX];
+char postfix_1[MAX]; //��ܥ� 
+char stack[MAX];
+double numStack[MAX];
+int top = -1;
+int numTop = -1;
+
+// === �禡�ŧi ===
+int get_priority(char op);
+int is_operator(char c);
+double calculate(double a, double b, char op);
+void convert_to_postfix();
+double evaluate_postfix();
+double evaluate_infix(char *expr);
+double parse_number(char **expr);
+
+int get_priority(char c){
+	if(c=='+' || c=='-'){
+		return 1;
+	}else if(c=='*' || c=='/'){
+		return 2;
+	}else if(c=='^'){
+		return 3;
+	}else{
+		return 0;
+	} 
+}
+
+// === �ˬd�r���O�_���B��l ===
+int is_operator(char c) {
+    return (c == '+' || c == '-' || c == '*' || c == '/' || c == '^');
+}
+
+// === ����B�� ===
+double calculate(double a, double b, char op) {
+    switch(op) {
+        case '+': return a + b;
+        case '-': return a - b;
+        case '*': return a * b;
+        case '/': 
+            if(b != 0) return a / b;
+            printf("���~�G���Ƥ��ର�s�I\n");
+            exit(1);
+        case '^': return pow(a, b);
+        default: return 0;
+    }
+}
+
+//��ܥ� 
+void convert_to_postfix_forprint() {
+    int i = 0, j;
+    int postfix_index = 0;
+    top = -1;
+    char number_str[MAX];
+    int is_negative;
+    
+    while(input[i] != '\0') {
+        if(isdigit(input[i]) || input[i] == '.' || (input[i] == '-' && (i == 0 || input[i-1] == '(' || is_operator(input[i-1])))) {
+            // �B�z�Ʀr�]�]�A�t�ơ^
+            is_negative = 0;
+            int num_len = 0;
+            
+            // �ˬd�O�_���t��
+            if(input[i] == '-') {
+                is_negative = 1;
+                i++;
+            }
+            
+            // ��������Ʀr�r��
+            while(input[i] != '\0' && (isdigit(input[i]) || input[i] == '.')) {
+                number_str[num_len++] = input[i++];
+            }
+            number_str[num_len] = '\0';
+            i--;  // �^�h�@�Ӧ�m�A�]���~�h while �|�A�[�@
+			
+            // ��X�Ʀr
+            printf("%s ", number_str);
+            if(is_negative) {
+                printf("- ");
+            }
+
+            // �N�Ʀr�[�J��Ǫ��F��
+            for(j = 0; j < num_len; j++) {
+                postfix_1[postfix_index++] = number_str[j];
+            }
+            postfix_1[postfix_index++] = ' ';
+            if(is_negative) {
+                postfix_1[postfix_index++] = '-';
+                postfix_1[postfix_index++] = ' ';
+            }
+        }
+        else if(input[i] == '(') {
+            stack[++top] = input[i];
+        }
+        else if(input[i] == ')') {
+            while(top >= 0 && stack[top] != '(') {
+                printf("%c ", stack[top]);
+                postfix_1[postfix_index++] = stack[top];
+                postfix_1[postfix_index++] = ' ';
+                top--;
+            }
+            if(top >= 0) top--;
+        }
+        else if(is_operator(input[i])) {
+            // �p�G���O�B�z�t�ƪ��
+            if(!(input[i] == '-' && (i == 0 || input[i-1] == '(' || is_operator(input[i-1])))) {
+                while(top >= 0 && stack[top] != '(' && 
+                      (get_priority(stack[top]) > get_priority(input[i]) ||
+                       (get_priority(stack[top]) == get_priority(input[i]) && input[i] != '^'))) {
+                    printf("%c ", stack[top]);
+                    postfix_1[postfix_index++] = stack[top];
+                    postfix_1[postfix_index++] = ' ';
+                    top--;
+                }
+                stack[++top] = input[i];
+            }
+        }
+        i++;
+    }
+    
+    while(top >= 0) {
+        printf("%c ", stack[top]);
+        postfix_1[postfix_index++] = stack[top];
+        postfix_1[postfix_index++] = ' ';
+        top--;
+    }
+    postfix_1[postfix_index] = '\0';
+    printf("\n");
+}
+
+// === �ഫ����Ǫ��F�� === 
+//�p��� 
+void convert_to_postfix() {
+    int i = 0 , j;
+    int postfix_index = 0;
+    top = -1;
+    
+    while(input[i] != '\0') {
+        if(isdigit(input[i]) || input[i] == '.' || (input[i] == '-' && (i == 0 || input[i-1] == '(' || is_operator(input[i-1])))) {  // �ˬd�O�_���Ʀr�B�p���I�άO�t���]�B�O���F�����}�l�A�κ��b���A���ιB��ū᭱�^ 
+            char *end;
+            double num = strtod(&input[i], &end); //strtod ��r�괫���B�I�� 
+            int len = end - &input[i];  //�p��Ʀr�r�ꪺ���� �Ʀr���ݪ��O�����}��������O�����m 
+//            printf("%.1f ", num);
+            for(j = 0; j < len; j++) {
+                postfix[postfix_index++] = input[i+j];
+            }
+            postfix[postfix_index++] = ' ';
+            i += len - 1;
+        }
+        else if(input[i] == '(') {
+            stack[++top] = input[i];
+        }
+        else if(input[i] == ')') {
+            while(top >= 0 && stack[top] != '(') {
+//                printf("%c ", stack[top]);
+                postfix[postfix_index++] = stack[top];
+                postfix[postfix_index++] = ' ';
+                top--;
+            }
+            if(top >= 0) top--;
+        }
+        else if(is_operator(input[i])) {
+            while(top >= 0 && stack[top] != '(' && (get_priority(stack[top]) > get_priority(input[i]) || (get_priority(stack[top]) == get_priority(input[i]) && input[i] != '^'))) {
+//                printf("%c ", stack[top]);
+                postfix[postfix_index++] = stack[top];
+                postfix[postfix_index++] = ' ';
+                top--;
+            }
+            stack[++top] = input[i];
+        }
+        i++;
+    }
+    
+    while(top >= 0) {
+//        printf("%c ", stack[top]);
+        postfix[postfix_index++] = stack[top];
+        postfix[postfix_index++] = ' ';
+        top--;
+    }
+    postfix[postfix_index] = '\0';
+//    printf("\n");
+}
+
+// === �p���Ǫ��F�� ===
+double evaluate_postfix() {
+	int i;
+    numTop = -1;
+    char *token = strtok(postfix, " ");
+    
+//    printf("\n�p��L�{�G\n");
+    
+    while(token != NULL) {
+//        printf("�B�z�аO�G'%s'\n", token);
+        
+        if(isdigit(token[0]) || (token[0] == '-' && isdigit(token[1]))) {
+            double num = atof(token);
+            numStack[++numTop] = num;
+//            printf("���J�Ʀr�G%.2f\n", num);
+        }
+        else if(is_operator(token[0])) {
+            if(numTop < 1) {
+                printf("�B��l '%c' �ʤ֨������B�⤸\n", token[0]);
+                exit(1);
+            }
+            double b = numStack[numTop--];
+            double a = numStack[numTop--];
+            double result = calculate(a, b, token[0]);
+            numStack[++numTop] = result;
+//            printf("�p��G%.2f %c %.2f = %.2f\n", a, token[0], b, result);
+        }
+        else {
+            printf("���~�G�������аO '%s'\n", token);
+            exit(1);
+        }
+        
+//        printf("���e���|�G");
+//        for(i = 0; i <= numTop; i++) {
+//            printf("%.2f ", numStack[i]);
+//        }
+//        printf("\n\n");
+        
+        token = strtok(NULL, " ");
+    }
+    
+    if(numTop != 0) {
+//        printf("���~�G�p�⵲������|���Ѿl %d �Ӥ���\n", numTop + 1);
+        exit(1);
+    }
+    return numStack[numTop];
+}
+
+int main() {
+
+    printf("�п�J���Ǫ��ܦ�(�䴩+-*/^()�B��) => ");
+    
+    fgets(input, MAX, stdin);
+    input[strcspn(input, "\n")] = 0;
+    
+    printf("\n��������Ǫ��ܪk���G ");
+    convert_to_postfix_forprint(); //��ܥ� 
+    convert_to_postfix();
+    double postfix_result = evaluate_postfix();
+    printf("\n�B�⵲�G�G%.4f", postfix_result);
+    
+    printf("\t(���T�Ȭ��G");
+    if(strcmp(input,"10+20*(50-30)/2^4-6*8")==0){
+    	printf("%g",10+20*(50-30)/pow(2,4)-6*8);
+	}else if(strcmp(input,"10+20*(-50+30)/-2^4-6*8")==0){
+    	printf("%g",10+20*(-50+30)/pow(-2,4)-6*8);
+	}else if(strcmp(input,"10.5+20.8*(50.1-30.6)/2.5^4-6.6*8.2")==0){
+    	printf("%g",10.5+20.8*(50.1-30.6)/pow(2.5,4)-6.6*8.2);
+	}else if(strcmp(input,"10.5+20.8*(-50.1+30.6)/2.5^-4-6.6*8.2")==0){
+    	printf("%g",10.5+20.8*(-50.1+30.6)/pow(2.5,-4)-6.6*8.2);
+	}printf(")");
+    
+    
+    return 0;
+}
diff --git a/作業/unit3/DS3.exe b/作業/unit3/DS3.exe
index 0f87075..f008051 100644
Binary files a/作業/unit3/DS3.exe and b/作業/unit3/DS3.exe differ
diff --git a/作業/unit3/DS3_try.c b/作業/unit3/DS3_try.c
new file mode 100644
index 0000000..fc6a257
--- /dev/null
+++ b/作業/unit3/DS3_try.c
@@ -0,0 +1,116 @@
+#include <stdio.h>
+#include <stdlib.h>
+#define MAX 50 
+char infix_q[MAX];
+int compare(char stack_o , char infix_o);
+void infix_to_postfix();
+
+
+
+int get_priority(char c){
+	if(c=='+' || c=='-'){
+		return 1;
+	}else if(c=='*' || c=='/'){
+		return 2;
+	}else if(c=='^'){
+		return 3;
+	}else{
+		return 0;
+	} 
+}
+
+int main(){
+	int i=0;
+	for(i=0;i<MAX;i++){
+		infix_q[i]='\0';
+	}
+	printf("\t--------------------------------------------\n");
+	printf("\t���ǹB�⦡�ഫ����ǹB�⦡\n");
+	printf("\t�i�H�ϥΪ��B��l�]�A:^,*,+,-,/,(,) ��\n");
+	printf("\t--------------------------------------------\n");
+	printf("\t�п�J���ǹB�⦡\n");
+	infix_to_postfix();
+	printf("\n");
+	return 0;
+}
+
+
+int compare(char stack_o,char infix_o){
+//	char infix_priority[9]={'#',')','+','-','*','/','^',' ','('};
+//	char stack_priority[8]={'#',')','+','-','*','/','^',' '};
+	int index_s = 0 ,index_i = 0;
+	while(stack_priority[index_s]!=stack_o){
+		index_s++;
+	}
+	while(infix_priority[index_i]!=infix_o){
+		index_i++;
+	}
+	return index_s/2 >= index_i/2 ? 1 : 0;
+}
+
+
+void infix_to_postfix() {
+    int rear = 0, top = 0, flag = 0, i = 0;
+    char stack_t[MAX];
+    int tag = 1;
+    for(i = 0; i < MAX; i++) {
+        stack_t[i] = '\0';
+    }
+    
+
+    fgets(infix_q, MAX, stdin);
+    infix_q[strcspn(infix_q, "\n")] = 0;
+    
+    i = 0;
+    while(infix_q[i] != '\0') {
+        i++;
+        rear++;
+    }
+    infix_q[rear] = '#';
+    printf("\t��Ǫ��ܪk�G");
+    stack_t[top] = '#';
+    
+    for(flag = 0; flag <= rear; flag++) {
+    	tag = 1;
+        switch(infix_q[flag]) {
+            case ')':
+                while(stack_t[top] != '(') {
+                    printf("%c", stack_t[top--]);
+                }
+                top--;
+                break;
+            case '#':
+                while(stack_t[top] != '#') {
+                    printf("%c", stack_t[top--]);
+                }
+                break;
+            case '(':
+            case '*':
+            case '/':
+            case '^':
+            	while(compare(stack_t[top], infix_q[flag]) == 1) {
+                    printf("%c", stack_t[top--]);
+                }
+                stack_t[++top] = infix_q[flag];
+                break;
+            case '+':
+            case '-':
+                if(tag==1){
+                	while(compare(stack_t[top], infix_q[flag]) == 1) {
+                    	printf("%c", stack_t[top--]);
+                	}
+                	stack_t[++top] = infix_q[flag];
+                	break;
+				}else if(tag==2){
+					
+				}
+                
+                
+            default:
+                if(infix_q[flag] != ' ') {  // ������
+                    printf("%c", infix_q[flag]);
+                }
+                break;
+        }
+    }
+}
diff --git a/作業/unit3/DS3_try.o b/作業/unit3/DS3_try.o
new file mode 100644
index 0000000..93c86cf
Binary files /dev/null and b/作業/unit3/DS3_try.o differ
diff --git a/作業/unit3/Makefile.win b/作業/unit3/Makefile.win
new file mode 100644
index 0000000..e2b0299
--- /dev/null
+++ b/作業/unit3/Makefile.win
@@ -0,0 +1,28 @@
+# Project: Project1
+# Makefile created by Dev-C++ 5.11
+
+CPP      = g++.exe
+CC       = gcc.exe
+WINDRES  = windres.exe
+OBJ      = ../../../���Ѯv�Ч�/�@�~/unit3/DS3.o
+LINKOBJ  = ../../../���Ѯv�Ч�/�@�~/unit3/DS3.o
+LIBS     = -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib" -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/lib" -static-libgcc
+INCS     = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include"
+CXXINCS  = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include/c++"
+BIN      = Project1.exe
+CXXFLAGS = $(CXXINCS) 
+CFLAGS   = $(INCS) 
+RM       = rm.exe -f
+
+.PHONY: all all-before all-after clean clean-custom
+
+all: all-before $(BIN) all-after
+
+clean: clean-custom
+	${RM} $(OBJ) $(BIN)
+
+$(BIN): $(OBJ)
+	$(CC) $(LINKOBJ) -o $(BIN) $(LIBS)
+
+../../../���Ѯv�Ч�/�@�~/unit3/DS3.o: ../../../���Ѯv�Ч�/�@�~/unit3/DS3.c
+	$(CC) -c ../../../���Ѯv�Ч�/�@�~/unit3/DS3.c -o ../../../���Ѯv�Ч�/�@�~/unit3/DS3.o $(CFLAGS)
diff --git a/作業/unit3/Project1.dev b/作業/unit3/Project1.dev
new file mode 100644
index 0000000..e589c42
--- /dev/null
+++ b/作業/unit3/Project1.dev
@@ -0,0 +1,62 @@
+[Project]
+FileName=Project1.dev
+Name=Project1
+Type=1
+Ver=2
+ObjFiles=
+Includes=
+Libs=
+PrivateResource=
+ResourceIncludes=
+MakeIncludes=
+Compiler=
+CppCompiler=
+Linker=
+IsCpp=0
+Icon=
+ExeOutput=
+ObjectOutput=
+LogOutput=
+LogOutputEnabled=0
+OverrideOutput=0
+OverrideOutputName=
+HostApplication=
+UseCustomMakefile=0
+CustomMakefile=
+CommandLine=
+Folders=
+IncludeVersionInfo=0
+SupportXPThemes=0
+CompilerSet=0
+CompilerSettings=0000000000000000000000000
+UnitCount=1
+
+[VersionInfo]
+Major=1
+Minor=0
+Release=0
+Build=0
+LanguageID=1033
+CharsetID=1252
+CompanyName=
+FileVersion=
+FileDescription=Developed using the Dev-C++ IDE
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=
+AutoIncBuildNr=0
+SyncProduct=1
+
+[Unit1]
+FileName=..\..\..\���Ѯv�Ч�\�@�~\unit3\DS3.c
+CompileCpp=0
+Folder=
+Compile=1
+Link=1
+Priority=1000
+OverrideBuildCmd=0
+BuildCmd=
+
diff --git a/作業/unit3/Project1.exe b/作業/unit3/Project1.exe
new file mode 100644
index 0000000..2fe8fe9
Binary files /dev/null and b/作業/unit3/Project1.exe differ
diff --git a/作業/unit3/Project1.layout b/作業/unit3/Project1.layout
new file mode 100644
index 0000000..ef35a90
--- /dev/null
+++ b/作業/unit3/Project1.layout
@@ -0,0 +1,13 @@
+[Editor_1]
+CursorCol=1
+CursorRow=1
+TopLine=1
+LeftChar=1
+[Editor_0]
+CursorCol=1
+CursorRow=47
+TopLine=28
+LeftChar=1
+[Editors]
+Order=0
+Focused=0
diff --git a/作業/unit3/claude.c b/作業/unit3/claude.c
new file mode 100644
index 0000000..ca92024
--- /dev/null
+++ b/作業/unit3/claude.c
@@ -0,0 +1,274 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <math.h>
+#include <ctype.h>
+#define MAX 100
+
+// === �����ܼƫŧi ===
+char input[MAX];
+char postfix[MAX];
+char stack[MAX];
+double numStack[MAX];
+int top = -1;
+int numTop = -1;
+
+// === �禡�ŧi ===
+int get_priority(char op);
+int is_operator(char c);
+double calculate(double a, double b, char op);
+void convert_to_postfix();
+double evaluate_postfix();
+double evaluate_infix(char *expr);
+double parse_number(char **expr);
+
+// === �ˬd�B��l�u������ ===
+//int get_priority(char op) {
+//    switch(op) {
+//        case '+': case '-': return 1;
+//        case '*': case '/': return 2;
+//        case '^': return 3;
+//        default: return 0;
+//    }
+//}
+
+int get_priority(char c){
+	if(c=='+' || c=='-'){
+		return 1;
+	}else if(c=='*' || c=='/'){
+		return 2;
+	}else if(c=='^'){
+		return 3;
+	}else{
+		return 0;
+	} 
+}
+
+
+// === �ˬd�r���O�_���B��l ===
+int is_operator(char c) {
+    return (c == '+' || c == '-' || c == '*' || c == '/' || c == '^');
+}
+
+// === ����B�� ===
+double calculate(double a, double b, char op) {
+    switch(op) {
+        case '+': return a + b;
+        case '-': return a - b;
+        case '*': return a * b;
+        case '/': 
+            if(b != 0) return a / b;
+            printf("���~�G���Ƥ��ର�s�I\n");
+            exit(1);
+        case '^': return pow(a, b);
+        default: return 0;
+    }
+}
+
+// === �ѪR�Ʀr�]�]�A�B�I�ơ^ ===
+double parse_number(char **expr) {
+    char *end;
+    double result = strtod(*expr, &end);
+    *expr = end;
+    return result;
+}
+
+// === �ഫ����Ǫ��F�� ===
+void convert_to_postfix() {
+    int i = 0 , j;
+    int postfix_index = 0;
+    top = -1;
+     
+//    printf("��Ǫ��ܪk�G");
+    
+    while(input[i] != '\0') {
+        if(isdigit(input[i]) || input[i] == '.' || (input[i] == '-' && (i == 0 || input[i-1] == '(' || is_operator(input[i-1])))) {
+            char *end;
+            double num = strtod(&input[i], &end);
+            int len = end - &input[i];
+            printf("%.1f ", num);
+            for(j = 0; j < len; j++) {
+                postfix[postfix_index++] = input[i+j];
+            }
+            postfix[postfix_index++] = ' ';
+            i += len - 1;
+        }
+        else if(input[i] == '(') {
+            stack[++top] = input[i];
+        }
+        else if(input[i] == ')') {
+            while(top >= 0 && stack[top] != '(') {
+                printf("%c ", stack[top]);
+                postfix[postfix_index++] = stack[top];
+                postfix[postfix_index++] = ' ';
+                top--;
+            }
+            if(top >= 0) top--;
+        }
+        else if(is_operator(input[i])) {
+            while(top >= 0 && stack[top] != '(' && 
+                  (get_priority(stack[top]) > get_priority(input[i]) ||
+                   (get_priority(stack[top]) == get_priority(input[i]) && input[i] != '^'))) {
+                printf("%c ", stack[top]);
+                postfix[postfix_index++] = stack[top];
+                postfix[postfix_index++] = ' ';
+                top--;
+            }
+            stack[++top] = input[i];
+        }
+        i++;
+    }
+    
+    while(top >= 0) {
+        printf("%c ", stack[top]);
+        postfix[postfix_index++] = stack[top];
+        postfix[postfix_index++] = ' ';
+        top--;
+    }
+    postfix[postfix_index] = '\0';
+    printf("\n");
+}
+
+// === �p���Ǫ��F�� ===
+double evaluate_postfix() {
+	int i;
+    numTop = -1;
+    char *token = strtok(postfix, " ");
+    
+//    printf("\n�p��L�{�G\n");
+    
+    while(token != NULL) {
+//        printf("�B�z�аO�G'%s'\n", token);
+        
+        if(isdigit(token[0]) || (token[0] == '-' && isdigit(token[1]))) {
+            double num = atof(token);
+            numStack[++numTop] = num;
+//            printf("���J�Ʀr�G%.2f\n", num);
+        }
+        else if(is_operator(token[0])) {
+            if(numTop < 1) {
+//                printf("���~�G�B��l '%c' �ʤ֨������ާ@��\n", token[0]);
+                exit(1);
+            }
+            double b = numStack[numTop--];
+            double a = numStack[numTop--];
+            double result = calculate(a, b, token[0]);
+            numStack[++numTop] = result;
+//            printf("�p��G%.2f %c %.2f = %.2f\n", a, token[0], b, result);
+        }
+        else {
+//            printf("���~�G�������аO '%s'\n", token);
+            exit(1);
+        }
+        
+//        printf("���e���|�G");
+        for(i = 0; i <= numTop; i++) {
+//            printf("%.2f ", numStack[i]);
+        }
+//        printf("\n\n");
+        
+        token = strtok(NULL, " ");
+    }
+    
+    if(numTop != 0) {
+//        printf("���~�G�p�⵲������|���Ѿl %d �Ӥ���\n", numTop + 1);
+        exit(1);
+    }
+    
+    return numStack[numTop];
+}
+
+// === �����p�⤤�Ǫ��F�� ===
+double evaluate_infix(char *expr) {
+    char opStack[MAX];
+    double valStack[MAX];
+    int opTop = -1;
+    int valTop = -1;
+    
+    printf("\n���ǭp��L�{�G\n");
+    
+    while(*expr) {
+        if(isspace(*expr)) {
+            expr++;
+            continue;
+        }
+        
+        if(isdigit(*expr) || *expr == '.' || (*expr == '-' && (valTop == -1 || opStack[opTop] == '('))) {
+            double num = parse_number(&expr);
+            valStack[++valTop] = num;
+            printf("���J�Ʀr: %f\n", num);
+        }
+        else if(*expr == '(') {
+            opStack[++opTop] = *expr++;
+            printf("���J���A��\n");
+        }
+        else if(*expr == ')') {
+            printf("�B�z�k�A��\n");
+            while(opTop >= 0 && opStack[opTop] != '(') {
+                char op = opStack[opTop--];
+                double b = valStack[valTop--];
+                double a = valStack[valTop--];
+                valStack[++valTop] = calculate(a, b, op);
+                printf("�p��: %f %c %f = %f\n", a, op, b, valStack[valTop]);
+            }
+            if(opTop >= 0) opTop--;  // �������A��
+            expr++;
+        }
+        else if(is_operator(*expr)) {
+            while(opTop >= 0 && opStack[opTop] != '(' && 
+                  (get_priority(opStack[opTop]) > get_priority(*expr) ||
+                   (get_priority(opStack[opTop]) == get_priority(*expr) && *expr != '^'))) {
+                char op = opStack[opTop--];
+                double b = valStack[valTop--];
+                double a = valStack[valTop--];
+                valStack[++valTop] = calculate(a, b, op);
+                printf("�p��: %f %c %f = %f\n", a, op, b, valStack[valTop]);
+            }
+            opStack[++opTop] = *expr++;
+            printf("���J�B��l: %c\n", *(expr-1));
+        }
+        else {
+            expr++;  // ���L�����r��
+        }
+    }
+    
+    while(opTop >= 0) {
+        char op = opStack[opTop--];
+        double b = valStack[valTop--];
+        double a = valStack[valTop--];
+        valStack[++valTop] = calculate(a, b, op);
+        printf("�p��: %f %c %f = %f\n", a, op, b, valStack[valTop]);
+    }
+    
+    return valStack[valTop];
+}
+
+int main() {
+
+    printf("�п�J���Ǫ��ܦ�(�䴩+-*/^()�B��) => ");
+    
+    fgets(input, MAX, stdin);
+    input[strcspn(input, "\n")] = 0;
+    
+    printf("\n��������Ǫ��ܪk���G ");
+    convert_to_postfix();
+    double postfix_result = evaluate_postfix();
+    printf("\n�B�⵲�G�G%.2f", postfix_result);
+    
+    printf("\t(���T�Ȭ��G");
+    if(strcmp(input,"10+20*(50-30)/2^4-6*8")==0){
+    	printf("%g",10+20*(50-30)/pow(2,4)-6*8);
+	}else if(strcmp(input,"10+20*(-50+30)/-2^4-6*8")==0){
+    	printf("%g",10+20*(-50+30)/pow(-2,4)-6*8);
+	}else if(strcmp(input,"10.5+20.8*(50.1-30.6)/2.5^4-6.6*8.2")==0){
+    	printf("%g",10.5+20.8*(50.1-30.6)/pow(2.5,4)-6.6*8.2);
+	}else if(strcmp(input,"10.5+20.8*(-50.1+30.6)/2.5^-4-6.6*8.2")==0){
+    	printf("%g",10.5+20.8*(-50.1+30.6)/pow(2.5,-4)-6.6*8.2);
+	}printf(")");
+    
+//    printf("\n=== ���Ǫ����p�� ===\n");
+//    double infix_result = evaluate_infix(input);
+//    printf("���ǭp�⵲�G�G%f\n", infix_result);
+    
+    return 0;
+}
diff --git a/作業/unit3/claude.exe b/作業/unit3/claude.exe
new file mode 100644
index 0000000..1cc834b
Binary files /dev/null and b/作業/unit3/claude.exe differ
diff --git a/作業/unit3/claude.o b/作業/unit3/claude.o
new file mode 100644
index 0000000..f1e4cff
Binary files /dev/null and b/作業/unit3/claude.o differ
diff --git a/作業/unit3/claude_easy.c b/作業/unit3/claude_easy.c
new file mode 100644
index 0000000..000465c
--- /dev/null
+++ b/作業/unit3/claude_easy.c
@@ -0,0 +1,136 @@
+#include <stdio.h>
+#include <stdlib.h>
+#define MAX 100
+
+// �ŧi�����ܼ�
+char input[MAX];    // �x�s��J���⦡
+char stack[MAX];    // �ΨӼȦs�B��l�����|
+int top = -1;       // ���|�����ݦ�m
+
+// === ���|���򥻾ާ@ ===
+void push(char c) {
+    top++;
+    stack[top] = c;
+}
+
+char pop() {
+    char c = stack[top];
+    top--;
+    return c;
+}
+
+// === �ˬd�B��l�u������ ===
+int get_priority(char op) {
+    switch(op) {
+        case '+': 
+        case '-': 
+            return 1;
+        case '*': 
+        case '/': 
+            return 2;
+        case '^': 
+            return 3;
+        case 'n':   // �t�����u�����dz̰�
+            return 4;
+        default: 
+            return 0;
+    }
+}
+
+// === �ˬd�r���O�_���B��l ===
+int is_operator(char c) {
+    return (c == '+' || c == '-' || c == '*' || c == '/' || c == '^');
+}
+
+// === �ˬd�O�_���t�� ===
+int is_negative_sign(char *expr, int pos) {
+    // �p�G�O�Ĥ@�Ӧr���A�N�O�t��
+    if (pos == 0) return 1;
+    
+    // �ˬd�e�@�ӫD�ťզr��
+    int prev = pos - 1;
+    while (prev >= 0 && expr[prev] == ' ') prev--;
+    
+    if (prev < 0) return 1;  // �p�G�e�����O�ťաA�]�O�t��
+    
+    // �p�G�e�@�Ӧr���O�B��l�Υ��A���A�N�O�t��
+    return (is_operator(expr[prev]) || expr[prev] == '(');
+}
+
+// === �D�n�ഫ�禡 ===
+void convert_to_postfix() {
+    int i = 0;
+    
+    printf("��Ǫ��ܪk�G");
+    
+    while(input[i] != '\0') {
+        char now = input[i];
+        
+        // �B�z�Ʀr�]�]�t�t�ơ^
+        if (now >= '0' && now <= '9') {
+            printf("%c", now);
+            while(input[i+1] >= '0' && input[i+1] <= '9') {
+                i++;
+                printf("%c", input[i]);
+            }
+            printf(" ");
+        }
+        // �B�z�t��
+        else if (now == '-' && is_negative_sign(input, i)) {
+            push('n');  // �ϥίS���r��'n'���ܭt��
+            i++;
+            // ������X�Ʀr����
+            while(input[i] >= '0' && input[i] <= '9') {
+                printf("%c", input[i]);
+                i++;
+            }
+            printf(" ");
+            // ��X�t��
+            printf("-");
+            i--;  // �^�h�@�Ӧ�m�A�]��while�`���ٷ|�[�@
+        }
+        // �B�z���A��
+        else if(now == '(') {
+            push(now);
+        }
+        // �B�z�k�A��
+        else if(now == ')') {
+            while(top >= 0 && stack[top] != '(') {
+                char op = pop();
+                printf("%c ", op == 'n' ? ' ' : op);
+            }
+            if(top >= 0) {
+                pop();  // �������A��
+            }
+        }
+        // �B�z�B��l
+        else if(is_operator(now)) {
+            while(top >= 0 && get_priority(stack[top]) >= get_priority(now)) {
+                char op = pop();
+                printf("%c ", op == 'n' ? ' ' : op);
+            }
+            push(now);
+        }
+         
+        i++;
+    }
+    
+    // ��X���|���ѤU���Ҧ��B��l
+    while(top >= 0) {
+        char op = pop();
+        printf("%c ", op == 'n' ? ' ' : op);
+    }
+}
+
+int main() {
+    printf("=== �������ǭp��� ===\n");
+    printf("�o�ӵ{���i�H��@�몺�⦡�ഫ����Ǫ��ܪk\n");
+    printf("�i�H�ϥΪ��Ÿ��G+, -, *, /, ^, (, )\n");
+    printf("�п�J�⦡�G");
+    
+    gets(input);
+    convert_to_postfix();
+    
+    printf("\n");
+    return 0;
+}
diff --git a/作業/unit3/claude_easy.exe b/作業/unit3/claude_easy.exe
new file mode 100644
index 0000000..da9db69
Binary files /dev/null and b/作業/unit3/claude_easy.exe differ
diff --git a/作業/unit3/claude_easy.o b/作業/unit3/claude_easy.o
new file mode 100644
index 0000000..98c20f7
Binary files /dev/null and b/作業/unit3/claude_easy.o differ
diff --git a/作業/unit3/gpt.c b/作業/unit3/gpt.c
new file mode 100644
index 0000000..c49cd79
--- /dev/null
+++ b/作業/unit3/gpt.c
@@ -0,0 +1,179 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+#include <math.h>  // �[�J�ƾǹB����
+
+#define N 50
+#define OP 6
+
+char op[OP] = {'(','+','-','*','/','^'};  // �W�[ ^ �B���
+int op_priority[OP] = {0,1,1,2,2,3};     // �N ^ ���u���ų]�� 3
+
+int priority(char c);
+void to_postfix(char infix[], char postfix[]);
+
+char stack[N];  // This is a global variable.
+int top = -1;
+
+// -------------------------
+//  �N��� item ��J���|
+// -------------------------
+void push(char item) {
+    if (top >= N - 1) {
+        printf("Stack full!\n");
+        exit(-1);
+    }
+    stack[++top] = item;
+}
+
+// ------------------------------------ 
+// �Ǧ^���|���ݪ���ơA���ëD���X  
+// ------------------------------------ 
+int pop() {
+    if (top == -1) {
+        printf("Stack empty!\n");
+        exit(-1);
+    }
+    return stack[top--];
+}
+
+// ----------------------
+// �P�_�O�_�����|
+// ----------------------
+bool IsEmpty(void) {
+    return (top < 0) ? true : false; 
+}
+
+// ----------------------
+//  �P�_���|�O�_����
+// ----------------------
+bool IsFull() {
+    return (top >= N - 1) ? true : false;
+}
+
+// --------------------------
+// �Ǧ^���|���ݪ����
+// --------------------------
+char top_data() {
+    return stack[top]; 
+}
+
+// ---------------------------
+// �Ǧ^�B��l c ���u����
+// ---------------------------
+int priority(char c) {
+	int i;
+    for (i = 0; i < OP; i++) {
+        if (op[i] == c)
+            return op_priority[i];
+    }
+    return -1;
+}
+
+// ------------------------------------
+// �N���m��infix�ন��m��postfix
+// ------------------------------------
+void to_postfix(char infix[], char postfix[]) {
+    int i = 0, j = -1;
+    char x, y;
+
+    while ((x = infix[i++]) != '\0') {
+        if (x >= '0' && x <= '9') {
+            // �B�z�h��Ʀr
+            while (infix[i] >= '0' && infix[i] <= '9') {
+                postfix[++j] = x;
+                x = infix[i++];
+            }
+            postfix[++j] = x;  // �N�Ʀr�s�J postfix
+            postfix[++j] = ' ';  // �ΪŮ���j�Ʀr
+        } else {
+            switch (x) {
+                case '(':
+                    push(x);
+                    break;
+                case ')':
+                    while (!IsEmpty() && (y = pop()) != '(') {
+                        postfix[++j] = y;
+                        postfix[++j] = ' ';
+                    }
+                    break;
+                case '+':
+                case '-':
+                case '*':
+                case '/':
+                case '^':
+                    while (!IsEmpty() && priority(top_data()) > priority(x)) {
+                        postfix[++j] = pop();
+                        postfix[++j] = ' ';
+                    }
+                    push(x);
+                    break;
+                default:
+                    break;
+            }
+        }
+    }
+    while (!IsEmpty()) {
+        postfix[++j] = pop();
+        postfix[++j] = ' ';
+    }
+    postfix[j] = '\0';
+}
+
+bool IsDigit(char c) {
+    return c >= '0' && c <= '9';
+}
+
+int calculate(char postfix[]) {
+    int point = 0, num = 0;
+    while (postfix[point] != '\0') {
+        if (IsDigit(postfix[point])) {
+            num = 0;
+            // �B�z�h��Ʀr
+            while (postfix[point] != ' ') {
+                num = num * 10 + (postfix[point] - '0');
+                point++;
+            }
+            push(num);  // �N�Ʀr���J���|
+        } else {
+            if (postfix[point] != ' ') {
+                int a = pop();
+                int b = pop();
+                int c = 0;
+                switch (postfix[point]) {
+                    case '+':
+                        c = b + a;
+                        break;
+                    case '-':
+                        c = b - a;
+                        break;
+                    case '*':
+                        c = b * a;
+                        break;
+                    case '/':
+                        c = b / a;
+                        break;
+                    case '^':
+                        c = (int)pow(b, a);  // ���ƹB��
+                        break;
+                }
+                push(c);
+            }
+        }
+        point++;
+    }
+    return pop();  // �̫᪺���G
+}
+
+int main(void) {
+    char infix[50], postfix[50];
+
+    printf("�п�J�B�⦡: ");
+    scanf("%s", infix);
+    to_postfix(infix, postfix);
+    printf("\n���Ǧ� : %s \t��Ǧ� : %s\n", infix, postfix);
+    printf("���סG %d\n", calculate(postfix));
+
+    return 0;
+}
+
diff --git a/作業/unit3/gpt.o b/作業/unit3/gpt.o
new file mode 100644
index 0000000..78b8214
Binary files /dev/null and b/作業/unit3/gpt.o differ
diff --git a/作業/unit3/stack.c b/作業/unit3/stack.c
new file mode 100644
index 0000000..bb876fa
--- /dev/null
+++ b/作業/unit3/stack.c
@@ -0,0 +1,54 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <conio.h>
+#define MAX 100
+
+int stack[MAX];
+int top = -1;
+
+int main() {
+	char option;
+	int i ;
+	while(1){
+		printf("\n*****************************\n");
+		printf("            <1>insert(push)\n");
+		printf("            <2>delete(pop)\n");
+		printf("            <3>list\n");
+		printf("            <4>quit\n");
+		printf("\n*****************************\n");
+		printf("Please enter your choice�G ");
+		option = getche();
+		switch(option){
+			case'1':
+				if (top >= MAX-1)   /* �����|�w���A��ܿ��~ */
+					 printf("Stack is full !");
+				    else {
+					 top++;
+					 printf("\n\n Enter item to insert:");
+					 scanf( "%d", &stack[top]);
+				    }
+				break;
+			case'2':
+			    if (top < 0)  /* �����|�S����Ʀs�b�A��ܿ��~ */
+				 printf("\n No item, stack is empty !\n");
+			    else {
+				 printf("\n\n Item %d deleted\n", stack[top]);
+				 top --;
+			    }
+				break;
+				
+			case'3':
+				printf("\n�ثe���|���Ʀr��: ");
+				for(i=0;i<=top;i++){
+					printf("%d ",stack[i]);
+				}
+				printf("\n");
+				break;
+			case'4':
+				return 1;
+				break;
+		}
+	}
+	
+	return 0;
+}
diff --git a/作業/unit3/stack.o b/作業/unit3/stack.o
new file mode 100644
index 0000000..c53c0e5
Binary files /dev/null and b/作業/unit3/stack.o differ
diff --git a/作業/unit3/try.c b/作業/unit3/try.c
new file mode 100644
index 0000000..fac61ae
--- /dev/null
+++ b/作業/unit3/try.c
@@ -0,0 +1,212 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <math.h>
+#include <ctype.h>
+#define MAX 100
+
+// === �����ܼƫŧi ===
+char input[MAX];
+char postfix[MAX];
+char stack[MAX];
+double numStack[MAX];
+int top = -1;
+int numTop = -1;
+
+// === �禡�ŧi ===
+int get_priority(char op);
+int is_operator(char c);
+double calculate(double a, double b, char op);
+void convert_to_postfix();
+double evaluate_postfix();
+
+// === �ˬd�B��l�u������ ===
+int get_priority(char c){
+    if(c=='+' || c=='-'){
+        return 1;
+    }else if(c=='*' || c=='/'){
+        return 2;
+    }else if(c=='^'){
+        return 3;
+    }else{
+        return 0;
+    } 
+}
+
+// === �ˬd�r���O�_���B��l ===
+int is_operator(char c) {
+    return (c == '+' || c == '-' || c == '*' || c == '/' || c == '^');
+}
+
+// === ����B�� ===
+double calculate(double a, double b, char op) {
+    switch(op) {
+        case '+': return a + b;
+        case '-': return a - b;
+        case '*': return a * b;
+        case '/': 
+            if(b != 0) return a / b;
+            printf("���~�G���Ƥ��ର�s�I\n");
+            exit(1);
+        case '^': return pow(a, b);
+        default: return 0;
+    }
+}
+
+// === �ഫ����Ǫ��F�� ===
+void convert_to_postfix() {
+    int i = 0, j;
+    int postfix_index = 0;
+    top = -1;
+    char number_str[MAX];
+    int is_negative;
+    
+    while(input[i] != '\0') {
+        if(isdigit(input[i]) || input[i] == '.' || 
+           (input[i] == '-' && (i == 0 || input[i-1] == '(' || is_operator(input[i-1])))) {
+            // �B�z�Ʀr�]�]�A�t�ơ^
+            is_negative = 0;
+            int num_len = 0;
+            
+            // �ˬd�O�_���t��
+            if(input[i] == '-') {
+                is_negative = 1;
+                i++;
+            }
+            
+            // ��������Ʀr�r��
+            while(input[i] != '\0' && (isdigit(input[i]) || input[i] == '.')) {
+                number_str[num_len++] = input[i++];
+            }
+            number_str[num_len] = '\0';
+            i--;  // �^�h�@�Ӧ�m�A�]���~�h while �|�A�[�@
+			
+            // ��X�Ʀr
+            printf("%s ", number_str);
+            if(is_negative) {
+                printf("- ");
+            }
+
+            // �N�Ʀr�[�J��Ǫ��F��
+            for(j = 0; j < num_len; j++) {
+                postfix[postfix_index++] = number_str[j];
+            }
+            postfix[postfix_index++] = ' ';
+            if(is_negative) {
+                postfix[postfix_index++] = '-';
+                postfix[postfix_index++] = ' ';
+            }
+        }
+        else if(input[i] == '(') {
+            stack[++top] = input[i];
+        }
+        else if(input[i] == ')') {
+            while(top >= 0 && stack[top] != '(') {
+                printf("%c ", stack[top]);
+                postfix[postfix_index++] = stack[top];
+                postfix[postfix_index++] = ' ';
+                top--;
+            }
+            if(top >= 0) top--;
+        }
+        else if(is_operator(input[i])) {
+            // �p�G���O�B�z�t�ƪ��
+            if(!(input[i] == '-' && (i == 0 || input[i-1] == '(' || is_operator(input[i-1])))) {
+                while(top >= 0 && stack[top] != '(' && 
+                      (get_priority(stack[top]) > get_priority(input[i]) ||
+                       (get_priority(stack[top]) == get_priority(input[i]) && input[i] != '^'))) {
+                    printf("%c ", stack[top]);
+                    postfix[postfix_index++] = stack[top];
+                    postfix[postfix_index++] = ' ';
+                    top--;
+                }
+                stack[++top] = input[i];
+            }
+        }
+        i++;
+    }
+    
+    while(top >= 0) {
+        printf("%c ", stack[top]);
+        postfix[postfix_index++] = stack[top];
+        postfix[postfix_index++] = ' ';
+        top--;
+    }
+    postfix[postfix_index] = '\0';
+    printf("\n");
+}
+
+// === �p���Ǫ��F�� ===
+double evaluate_postfix() {
+	int i;
+    numTop = -1;
+    char *token = strtok(postfix, " ");
+    
+    printf("\n�p��L�{�G\n");
+    
+    while(token != NULL) {
+        printf("�B�z�аO�G'%s'\n", token);
+        
+        if(isdigit(token[0]) || (token[0] == '-' && isdigit(token[1]))) {
+            double num = atof(token);
+            numStack[++numTop] = num;
+            printf("���J�Ʀr�G%.2f\n", num);
+        }
+        else if(is_operator(token[0])) {
+            if(numTop < 1) {
+                printf("���~�G�B��l '%c' �ʤ֨������ާ@��\n", token[0]);
+                exit(1);
+            }
+            double b = numStack[numTop--];
+            double a = numStack[numTop--];
+            double result = calculate(a, b, token[0]);
+            numStack[++numTop] = result;
+            printf("�p��G%.2f %c %.2f = %.2f\n", a, token[0], b, result);
+        }
+        else {
+            printf("���~�G�������аO '%s'\n", token);
+            exit(1);
+        }
+        
+        printf("���e���|�G");
+        for(i = 0; i <= numTop; i++) {
+            printf("%.2f ", numStack[i]);
+        }
+        printf("\n\n");
+        
+        token = strtok(NULL, " ");
+    }
+    
+    if(numTop != 0) {
+        printf("���~�G�p�⵲������|���Ѿl %d �Ӥ���\n", numTop + 1);
+        exit(1);
+    }
+    
+    return numStack[numTop];
+}
+
+int main() {
+    printf("�п�J���Ǫ��ܦ�(�䴩+-*/^()�B��) => ");
+    
+    fgets(input, MAX, stdin);
+    input[strcspn(input, "\n")] = 0;
+    
+    printf("\n��������Ǫ��ܪk���G ");
+    convert_to_postfix();
+    double postfix_result = evaluate_postfix();
+    printf("\n�B�⵲�G�G%.2f", postfix_result);
+    
+    printf("\t(���T�Ȭ��G");
+    if(strcmp(input,"10+20*(50-30)/2^4-6*8")==0){
+        printf("%g",10+20*(50-30)/pow(2,4)-6*8);
+    }else if(strcmp(input,"10+20*(-50+30)/-2^4-6*8")==0){
+        printf("%g",10+20*(-50+30)/pow(-2,4)-6*8);
+    }else if(strcmp(input,"10.5+20.8*(50.1-30.6)/2.5^4-6.6*8.2")==0){
+        printf("%g",10.5+20.8*(50.1-30.6)/pow(2.5,4)-6.6*8.2);
+    }else if(strcmp(input,"10.5+20.8*(-50.1+30.6)/2.5^-4-6.6*8.2")==0){
+        printf("%g",10.5+20.8*(-50.1+30.6)/pow(2.5,-4)-6.6*8.2);
+    }
+    printf(")");
+    
+    return 0;
+}
diff --git a/作業/unit3/try.o b/作業/unit3/try.o
new file mode 100644
index 0000000..d3d2a55
Binary files /dev/null and b/作業/unit3/try.o differ
diff --git a/作業/unit3/新增資料夾/DS3.cpp b/作業/unit3/work.c
similarity index 100%
rename from 作業/unit3/新增資料夾/DS3.cpp
rename to 作業/unit3/work.c
diff --git a/作業/unit3/work.exe b/作業/unit3/work.exe
new file mode 100644
index 0000000..dd2a422
Binary files /dev/null and b/作業/unit3/work.exe differ
diff --git a/作業/unit3/work.o b/作業/unit3/work.o
new file mode 100644
index 0000000..02c3ecb
Binary files /dev/null and b/作業/unit3/work.o differ
diff --git a/作業/unit4/DS4.c b/作業/unit4/DS4.c
new file mode 100644
index 0000000..0ec9e23
--- /dev/null
+++ b/作業/unit4/DS4.c
@@ -0,0 +1,441 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#include <conio.h> 	
+
+#define MAX_NAME_LENGTH 24
+
+//�ŧi�禡�쫬 
+void init_f();
+void insertStudent(char* name, int english, int math);
+void modify_list();
+void add_data(char* name, int english, int math);
+void remove_data(char* name);
+void readStudentsFromFile(char* filename);
+void printStudentList();
+void sort_name();
+void sort_eng();
+void sort_math();
+void choose_subject();
+void find_student(int number , int mode);
+
+// �w�q�ǥ͸`�I���c
+typedef struct Student {
+    char name[MAX_NAME_LENGTH];
+    int english;
+    int math;
+    struct Student* llink;
+    struct Student* rlink;
+} Student;
+
+Student *head, *tail, *current, *prev, *temp;
+FILE* file; 
+
+//�]�@�� head�A�N���k�쵲�ҫ��V����
+void init_f() {
+    head = (Student *) malloc(sizeof(Student));  // ������ head
+    head->llink = head;    // ���쵲���V�ۤv
+    head->rlink = head;    // �k�쵲���V�ۤv
+    tail = head;   
+}
+
+// �b�������J�s�ǥ͸`�I
+void insertStudent(char* name, int english, int math) {
+
+    Student* newNode = (Student*)malloc(sizeof(Student));
+	strcpy(newNode->name, name);
+	
+    newNode->english = english;
+    newNode->math = math;
+
+	if(head->rlink == tail) {
+        // �o�O�Ĥ@�Ӵ��J���`�I
+        head->rlink = newNode;
+        tail->llink = newNode;
+        newNode->llink = head;
+        newNode->rlink = tail;
+    } else {
+    	//���O�Ĥ@�� ���J����  
+        newNode->llink = tail->llink;  
+        newNode->rlink = tail;         
+        tail->llink->rlink = newNode;  
+        tail->llink = newNode;
+    }
+}
+
+// ����***�᪺�W�[�δ�ָ�� 
+void modify_list(){
+	char name[MAX_NAME_LENGTH];
+    int english, math;
+	char line[100];
+	
+	while(fgets(line, sizeof(line), file)!=NULL){
+		if(line[0]=='+'){
+			sscanf(line+2, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+			printf("\n*******************************\n");
+	    	printf("�W�[�@�����\n\n");
+	    	add_data(name, english, math);
+	    	printStudentList();
+		}else if(line[0]=='-'){
+			sscanf(line+2, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+			printf("\n*******************************\n");
+	    	printf("�R���@�����\n\n");
+	    	remove_data(name);
+	    	printStudentList();
+	    }
+	}
+	fclose(file);
+}
+
+//�W�[��� 
+void add_data(char* name, int english, int math){
+	Student* newNode = (Student*)malloc(sizeof(Student));
+	strcpy(newNode->name, name);
+	
+    newNode->english = english;
+    newNode->math = math;
+    
+    newNode->llink = tail->llink;  
+    newNode->rlink = tail;         
+    tail->llink->rlink = newNode;  
+    tail->llink = newNode;
+    printf("%s �w�W�[\n\n", name);
+}
+
+//��ָ�� 
+void remove_data(char* name){
+
+	prev = head;
+    current = head->rlink;
+    
+	while(current!=tail &&strcmp(name,current->name)!=0){
+		prev=current;
+		current=current->rlink;
+	}
+	if(current != tail){
+		
+		current->rlink->llink = prev;
+		prev->rlink = current->rlink;
+		printf("%s �w�R��\n\n", name);
+		free(current);
+	}else  /* �䤣���ƫh��ܿ��~ */
+        printf(" %s ���b��C��\n", name);
+	
+}
+
+// �q���Ū���ǥ͸��
+void readStudentsFromFile(char* filename) {
+    file = fopen(filename, "r");
+    if (file == NULL) {
+        printf("�L�k�}���ɮ� %s\n", filename);
+        return;
+    }
+
+    char line[100];
+    int lineCount = 0;
+
+    // ���L�e�|��
+    while (lineCount < 4 && fgets(line, sizeof(line), file)) {
+        lineCount++;
+    }
+
+    // Ū���ǥ͸��
+    char name[MAX_NAME_LENGTH];
+    int english, math;
+	// %[ ]���ܭnŪ�J�@�Ӧr�Ŷ��X  
+	// %23[^\t]���uŪ���̦h23�Ӧr�šA����J��\t����v ^���D ���O\t�NŪ 
+	// �Y���\Ū�����Ʒ|�^��3 �YŪ������ �uŪ��name�ΨSŪ���ƫh�^�ǭȤ�����3 
+	while(fgets(line, sizeof(line), file)!=NULL){
+		if(isalpha(line[0])){
+			sscanf(line, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+			insertStudent(name, english, math);
+		}else if(line[0]=='*'){
+			break;
+		}
+	}
+//	��flocse�����ե� ���`�ϥ����bmodify_list������ 
+//	fclose(file);
+}
+
+// �C�L�ǥͦC��
+void printStudentList() {
+	
+	current = head->rlink;
+	
+	printf("\n�q�Y�}�l\n");
+    printf("\n�m�W\t\t�^��\t�ƾ�\n");
+	printf("--------------------------------\n");
+	
+    while (current != tail) {
+        printf("%-15s\t%d\t%d\n", current->name, current->english, current->math);
+        current = current->rlink;
+    }
+    
+    current = tail->llink;
+    
+    printf("\n�q���}�l\n");	
+    printf("\n�m�W\t\t�^��\t�ƾ�\n");
+    printf("--------------------------------\n");
+    while (current != head) {
+        printf("%-15s\t%d\t%d\n", current->name, current->english, current->math);
+        current = current->llink;
+    }
+}
+
+//�̷ӦW�r�i��Ƨ� 
+void sort_name(){ 
+
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(strcmp(current->name,temp->name) > 0){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+//�̷ӭ^�妨�Z�i��Ƨ� 
+void sort_eng(){ 
+
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->english < temp->english){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+}
+
+//�̷ӭ^�妨�Z�i��Ƨ� 
+void sort_math(){ 
+
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->math < temp->math){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+//��ܬ�ؤαƦW 
+void choose_subject(){
+	int subject ,number , i=1;
+	
+	printf("\n��J��ܪ����\n"
+	"1 �ƾ� 2 �^�� ==> ");
+	subject = getche();
+	switch(subject){
+			case '1':
+				printf("\n��J�ƦW(��J�����Ы�Enter) ==> ");
+				scanf("%d",&number);
+				sort_math();
+				find_student(number , 1); 
+				
+				printf("\n���Ҧp�U");
+				printf("\n�ƦW\t�m�W\t\t�^��\t�ƾ�");
+				printf("\n-----------------------------------\n");
+				Student* current = head->rlink;
+				while (current != tail) {
+						printf("%d\t%-15s\t%d\t%d\n",i++, current->name, current->english, current->math);
+				    	current = current->rlink;
+				    	}
+				break;
+			case '2':
+				printf("\n��J�ƦW(��J�����Ы�Enter) ==> ");
+				scanf("%d",&number);
+				sort_eng();	
+				find_student(number , 2); 
+				
+				printf("\n���Ҧp�U");
+				printf("\n�ƦW\t�m�W\t\t�^��\t�ƾ�");
+				printf("\n-----------------------------------\n");
+				current = head->rlink;
+				while (current != tail) {
+						printf("%d\t%-15s\t%d\t%d\n",i++, current->name, current->english, current->math);
+				    	current = current->rlink;
+				    	}
+				break;
+			default :
+				printf("��J���~");
+				break;
+		}	
+}
+
+
+//�ھڬ�ؤαƦW��ǥ� 
+void find_student(int number , int mode){
+	current = head->rlink;
+	
+	int i = 1;
+	while (current != tail && i < number) {
+        current = current->rlink;
+        i++;
+    }
+    if(current!=tail && number != 0){
+    	printf("\n*****************************\n");
+    	if(mode == 1 ){
+    		printf("�ƾ�");
+		}else if(mode == 2){
+			printf("�^��");
+		}
+    	printf("�ƦW��%d���ǥͬ�\n\n"
+		"�m�W\t\t�^��\t�ƾ�\n%-15s\t%d\t%d", number, current->name, current->english, current->math);
+		printf("\n*****************************\n");
+	}else{
+		printf("\n*****************************\n");
+		printf("��Ƥ��s�b"); 
+		printf("\n*****************************\n");
+	}
+}
+
+//����Ҧ��`�I 
+void freeAllNodes() {
+    current = head->rlink;
+    while (current != tail) {
+        Student* temp = current;
+        current = current->rlink;
+        free(temp);
+    }
+    free(head);  // ���� head �`�I
+}
+
+int main() {
+	char mode ,sort_mode;
+    init_f();
+    readStudentsFromFile("YunTechStudents2.txt");
+    printStudentList();
+    modify_list();
+	
+	while(1){
+		printf("\n******* ��ܶi��ƧǩάO�ƦW��n�W���ǥ� *******\n"
+			   "*--------------------------------------*\n"
+			   "* 1 �i��Ƨ�   2 ��ܱƦW��n�W���ǥ�   3 ���� *\n"
+			   "\n�п�ܥ\\�� ==> "); //������ �\\�� �b�������|�ܶýX 
+		mode = getche();
+		switch(mode){
+			case '1':
+				printf("\n\n��ܱƧǤ覡\n"
+			   	"*--------------------------------------*\n"
+			   	"1 �W�r   2 �^�妨�Z   3 �ƾǦ��Z \n"
+			   	"\n�п�ܱƧǤ覡 ==> "); 
+				sort_mode = getche();
+				switch(sort_mode){
+					case '1':
+						printf("\n\n�H�W�r�i��Ƨ�\n");
+						sort_name();
+						printStudentList();
+						break;
+					case '2':
+						printf("\n\n�H�^�妨�Z�i��Ƨ�\n");
+						sort_eng();	
+						printStudentList();
+						break;
+					case '3':
+						printf("\n\n�H�ƾǦ��Z�i��Ƨ�\n");
+						sort_math();
+						printStudentList();
+						break;
+					default:
+						printf("\n��J���~\n");
+						break;
+					} 
+					break;
+			case '2':
+				choose_subject();
+				break;
+			case '3':
+				printf("\n\n���¨ϥΡABye~\n");
+				freeAllNodes();
+				return 0;
+			default:
+				printf("\n��J���~\n");
+				break;
+		} 
+	}
+}
diff --git a/作業/unit4/DS4.exe b/作業/unit4/DS4.exe
new file mode 100644
index 0000000..fe836ab
Binary files /dev/null and b/作業/unit4/DS4.exe differ
diff --git a/作業/unit4/DS4.o b/作業/unit4/DS4.o
new file mode 100644
index 0000000..b7ee53a
Binary files /dev/null and b/作業/unit4/DS4.o differ
diff --git a/作業/unit4/DS4.zip b/作業/unit4/DS4.zip
new file mode 100644
index 0000000..5479b58
Binary files /dev/null and b/作業/unit4/DS4.zip differ
diff --git a/作業/unit4/DS4/DS4.c b/作業/unit4/DS4/DS4.c
new file mode 100644
index 0000000..e5f159a
--- /dev/null
+++ b/作業/unit4/DS4/DS4.c
@@ -0,0 +1,438 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#include <conio.h> 	
+
+#define MAX_NAME_LENGTH 24
+
+//�ŧi�禡�쫬 
+void init_f();
+void readStudentsFromFile(char* filename);
+void insertStudent(char* name, int english, int math);
+void printStudentList();
+void sort_name();
+void sort_eng();
+void sort_math();
+void modify_list();
+void add_data(char* name, int english, int math);
+void remove_data(char* name);
+void choose_subject();
+void find_student(int number , int mode);
+
+// �w�q�ǥ͸`�I���c
+typedef struct Student {
+    char name[MAX_NAME_LENGTH];
+    int english;
+    int math;
+    struct Student* llink;
+    struct Student* rlink;
+} Student;
+
+Student *head, *tail, *current, *prev, *temp;
+FILE* file; 
+
+void init_f() {
+    head = (Student *) malloc(sizeof(Student));
+    tail = (Student *) malloc(sizeof(Student));
+    
+//    head->llink = head;    // ���쵲���V�ۤv
+//    head->rlink = head;    // �k�쵲���V�ۤv
+//    tail = head;
+    
+//	head->llink = tail;
+	head->rlink = tail;
+//	tail->rlink = head;
+	tail->llink = head;
+}
+
+// �b�������J�s�ǥ͸`�I
+void insertStudent(char* name, int english, int math) {
+
+    Student* newNode = (Student*)malloc(sizeof(Student));
+	
+	strcpy(newNode->name, name);
+    newNode->english = english;
+    newNode->math = math;
+
+//  ���J����  
+    newNode->llink = tail->llink;  
+    newNode->rlink = tail;         
+    tail->llink->rlink = newNode;  
+    tail->llink = newNode;
+}
+
+//�W�[��� 
+void add_data(char* name, int english, int math){
+	Student* newNode = (Student*)malloc(sizeof(Student));
+	
+	strcpy(newNode->name, name);
+    newNode->english = english;
+    newNode->math = math;
+    
+    newNode->llink = tail->llink;  
+    newNode->rlink = tail;         
+    tail->llink->rlink = newNode;  
+    tail->llink = newNode;
+    printf("%s �w�W�[\n", name);
+}
+
+//��ָ�� 
+void remove_data(char* name){
+
+	prev = head;
+    current = head->rlink;
+    
+	while(current!=tail &&strcmp(name,current->name)!=0){
+		prev=current;
+		current=current->rlink;
+	}
+	if(current != tail){
+		
+		current->rlink->llink = prev;
+		prev->rlink = current->rlink;
+		printf("%s �w�R��\n", name);
+		free(current);
+	}else  /* �䤣���ƫh��ܿ��~ */
+        printf(" %s ���b��C��\n", name);
+	
+}
+
+// �q���Ū���ǥ͸��
+void readStudentsFromFile(char* filename) {
+    file = fopen(filename, "r");
+    if (file == NULL) {
+        printf("�L�k�}���ɮ� %s\n", filename);
+        return;
+    }
+
+    char line[100];
+    int lineCount = 0;
+
+    // ���L�e�|��
+    while (lineCount < 4 && fgets(line, sizeof(line), file)) {
+        lineCount++;
+    }
+
+    // Ū���ǥ͸��
+    char name[MAX_NAME_LENGTH];
+    int english, math;
+	// %[ ]���ܭnŪ�J�@�Ӧr�Ŷ��X  
+	// %23[^\t]���uŪ���̦h23�Ӧr�šA����J��\t����v ^���D ���O\t�NŪ  
+	while(fgets(line, sizeof(line), file)!=NULL){
+		if(isalpha(line[0])){
+			sscanf(line, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+			insertStudent(name, english, math);
+		}else if(line[0]=='*'){
+			break;
+		}
+	}
+//	��flocse�����ե� ���`�ϥ����bmodify_list������ 
+//	fclose(file);
+}
+
+// ����***�᪺�W�[�δ�ָ�� 
+void modify_list(){
+	char name[MAX_NAME_LENGTH];
+    int english, math;
+	char line[100];
+	
+	while(fgets(line, sizeof(line), file)!=NULL){
+		if(line[0]=='+'){
+			sscanf(line, "%*[^ ] %[^\t]\t%d\t%d\n", name, &english, &math);
+			printf("\n===============================\n");
+	    	printf("�W�[�@�����\n\n");
+	    	add_data(name, english, math);
+	    	printStudentList();
+		}else if(line[0]=='-'){
+			sscanf(line, "%*[^ ] %[^\t]\t%d\t%d\n", name, &english, &math);
+			printf("\n===============================\n");
+	    	printf("�R���@�����\n\n");
+	    	remove_data(name);
+	    	printStudentList();
+	    }
+	}
+	fclose(file);
+}
+
+// �C�L�ǥͦC��
+void printStudentList() {
+	
+	current = head->rlink;
+	
+	printf("\n�q�Y�}�l\n");
+    printf("\n�m�W\t\t�^��\t�ƾ�\n");
+	printf("--------------------------------\n");
+	
+    while (current != tail) {
+        printf("%-15s\t%d\t%d\n", current->name, current->english, current->math);
+        current = current->rlink;
+    }
+    
+    current = tail->llink;
+    
+    printf("\n�q���}�l\n");
+    printf("\n�m�W\t\t�^��\t�ƾ�\n");
+    printf("--------------------------------\n");
+    while (current != head) {
+        printf("%-15s\t%d\t%d\n", current->name, current->english, current->math);
+        current = current->llink;
+    }
+}
+
+//�̷ӦW�r�i��Ƨ� 
+void sort_name(){ 
+
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(strcmp(current->name,temp->name) > 0){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+//�̷ӭ^�妨�Z�i��Ƨ� 
+void sort_eng(){ 
+
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->english < temp->english){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+}
+
+//�̷ӼƾǦ��Z�i��Ƨ� 
+void sort_math(){ 
+
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->math < temp->math){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+//��ܬ�ؤαƦW 
+void choose_subject(){
+	int subject ,number , i=1;
+	
+	printf("\n��J��ܪ����\n"
+	"1 �ƾ� 2 �^�� ==> ");
+	subject = getche();
+	switch(subject){
+			case '1':
+				printf("\n��J�ƦW(��J�����Ы�Enter) ==> ");
+				scanf("%d",&number);
+				sort_math();
+				find_student(number , 1); 
+				
+				printf("\n���Ҧp�U");
+				printf("\n�ƦW\t�m�W\t\t�^��\t�ƾ�");
+				printf("\n-----------------------------------\n");
+				current = head->rlink;
+				while (current != tail) {
+						printf("%d\t%-15s\t%d\t%d\n",i++, current->name, current->english, current->math);
+				    	current = current->rlink;
+				    	}
+				break;
+			case '2':
+				printf("\n��J�ƦW(��J�����Ы�Enter) ==> ");
+				scanf("%d",&number);
+				sort_eng();	
+				find_student(number , 2); 
+				
+				printf("\n���Ҧp�U");
+				printf("\n�ƦW\t�m�W\t\t�^��\t�ƾ�");
+				printf("\n-----------------------------------\n");
+				current = head->rlink;
+				while (current != tail) {
+						printf("%d\t%-15s\t%d\t%d\n",i++, current->name, current->english, current->math);
+				    	current = current->rlink;
+				    	}
+				break;
+			default :
+				printf("��J���~");
+				break;
+		}	
+}
+
+//�ھڬ�ؤαƦW��ǥ� 
+void find_student(int number , int mode){
+	current = head->rlink;
+	
+	int i = 1;
+	while (current != tail && i < number) {
+        current = current->rlink;
+        i++;
+    }
+    if(current!=tail && number != 0){
+    	printf("\n*****************************\n");
+    	if(mode == 1 ){
+    		printf("�ƾ�");
+		}else if(mode == 2){
+			printf("�^��");
+		}
+    	printf("�ƦW��%d���ǥͬ�\n\n"
+		"�m�W\t\t�^��\t�ƾ�\n%-15s\t%d\t%d", number, current->name, current->english, current->math);
+		printf("\n*****************************\n");
+	}else{
+		printf("\n*****************************\n");
+		printf("��Ƥ��s�b"); 
+		printf("\n*****************************\n");
+	}
+}
+
+//����Ҧ��`�I 
+void freeAllNodes() {
+    current = head->rlink;
+    while (current != tail) {
+        temp = current;
+        current = current->rlink;
+        free(temp);
+    }
+    free(head);  // ���� head �`�I
+    free(tail);	 // ���� tail �`�I
+}
+
+int main() {
+	char mode ,sort_mode;
+    init_f();
+    readStudentsFromFile("YunTechStudents.txt");
+    printStudentList();
+    modify_list();
+	
+	while(1){
+		printf("\n******* ��ܶi��ƧǩάO�ƦW��n�W���ǥ� *******\n"
+			   "*--------------------------------------*\n"
+			   "* 1 �i��Ƨ�   2 ��ܱƦW��n�W���ǥ�   3 ���� *\n"
+			   "\n�п�ܥ\\�� ==> "); //������ �\\�� �b�������|�ܶýX 
+		mode = getche();
+		switch(mode){
+			case '1':
+				printf("\n\n��ܱƧǤ覡\n"
+			   	"*--------------------------------------*\n"
+			   	"1 �W�r   2 �^�妨�Z   3 �ƾǦ��Z \n"
+			   	"\n�п�ܱƧǤ覡 ==> "); 
+				sort_mode = getche();
+				switch(sort_mode){
+					case '1':
+						printf("\n\n�H�W�r�i��Ƨ�\n");
+						sort_name();
+						printStudentList();
+						break;
+					case '2':
+						printf("\n\n�H�^�妨�Z�i��Ƨ�\n");
+						sort_eng();	
+						printStudentList();
+						break;
+					case '3':
+						printf("\n\n�H�ƾǦ��Z�i��Ƨ�\n");
+						sort_math();
+						printStudentList();
+						break;
+					default:
+						printf("\n��J���~\n");
+						break;
+					} 
+					break;
+			case '2':
+				choose_subject();
+				break;
+			case '3':
+				printf("\n\n���¨ϥΡABye~\n");
+				freeAllNodes();
+				return 0;
+			default:
+				printf("\n��J���~\n");
+				break;
+		} 
+	}
+}
diff --git a/作業/unit4/DS4/DS4.exe b/作業/unit4/DS4/DS4.exe
new file mode 100644
index 0000000..4b8d2b0
Binary files /dev/null and b/作業/unit4/DS4/DS4.exe differ
diff --git a/作業/unit4/DS4/YunTechStudents.txt b/作業/unit4/DS4/YunTechStudents.txt
new file mode 100644
index 0000000..665b05c
--- /dev/null
+++ b/作業/unit4/DS4/YunTechStudents.txt
@@ -0,0 +1,18 @@
+YunTech EE Department (2024)
+======================================
+Name		English	Math		
+---------------+-------+--------------
+Steve Jobs	50	60
+Tom Cruise	30	40
+Marie Jane	70	80
+Barrack Obama	46	77
+John Tyler	98	96
+U. S. Grant	97	88
+Robert Redford	22	33
+Bruce Lee	90	90
+**************************************
++ Oliver Hardy	90	80
++ Slim Pickens	88	82
+- Marie Jane	0	0
++ James Bond	88	82
+- Barrack Obama	0	0
\ No newline at end of file
diff --git a/作業/unit4/DS4/sheng_v2.cpp b/作業/unit4/DS4/sheng_v2.cpp
new file mode 100644
index 0000000..e941d89
--- /dev/null
+++ b/作業/unit4/DS4/sheng_v2.cpp
@@ -0,0 +1,364 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+
+typedef struct Student 
+{
+    char name[40];
+    int eng;
+    int math;
+    struct Student *prev;
+    struct Student *next;
+} Student;    
+Student *head = NULL, *tail = NULL, *current;
+
+// �s�W�`�I���쵲��C����
+void addToList(const char *name, int eng, int math)
+{
+    // �t�m�s�`�I�O����
+    Student *newStudent = (Student*)malloc(sizeof(Student));
+    // �ƻs��ƨ�s�`�I
+    strncpy(newStudent->name, name, sizeof(newStudent->name) - 1);
+    newStudent->name[sizeof(newStudent->name) - 1] = '\0';
+    newStudent->eng = eng;  
+    newStudent->math = math;  
+    newStudent->next = NULL;
+    // �p�G�O�Ĥ@�Ӹ`�I
+    if (head == NULL)
+    {
+        newStudent->prev = NULL;
+        head = tail = newStudent;
+    }
+    else // �[�J�����
+    {
+        newStudent->prev = tail;
+        tail->next = newStudent;
+        tail = newStudent;
+    }
+}
+
+// ��ܩҦ��ǥ͸��
+void displayList()
+{
+    //Student *
+	current = head;
+    printf("�ǥ͸�ƦC��(�q�Y�}�l)�G\n\n");    
+    printf("�m�W\t\t\t\t�^��\t�ƾ�\n");
+    printf("---------------------------------------------\n");
+    for(int i=0; current!=NULL; current=current->next,i++)
+    {
+        printf("%d.\t%-16s\t%d\t%d\n\n", i+1, current->name, current->eng, current->math);
+    }
+    printf("---------------------------------------------\n");
+}
+// �q���}�l�C�L 
+void displayList_inverse()
+{
+    Student *current = tail;    
+    printf("�ǥ͸�ƦC��(�q���}�l)�G\n\n");    
+    printf("�m�W\t\t\t\t�^��\t�ƾ�\n");
+    printf("---------------------------------------------\n");
+    for(int i=0; current!=NULL; current=current->prev,i++)
+    {
+        printf("%d.\t%-16s\t%d\t%d\n\n", i+1, current->name, current->eng, current->math);
+    }
+    printf("---------------------------------------------\n");
+}
+// ����Ҧ��ʺA���t���`�I
+void cleanup()
+{
+    Student *current = head;
+    while (current != NULL)
+    {
+        Student *temp = current;
+        current = current->next;
+        free(temp);
+    }
+    head = tail = NULL;
+}
+// ��s�᪺�R�����
+void deletedate(const char *name, int eng, int math)
+{
+    Student *current = head;
+    while(current != NULL)
+    {
+        if(strcmp(current->name, name) == 0)
+        {    
+            if(current->prev != NULL) current->prev->next = current->next;
+            else head = current->next;
+            
+            if(current->next != NULL) current->next->prev = current->prev;
+            else tail = current->prev;
+            
+            free(current);
+            return;
+        }
+        current = current->next;
+    }
+}
+// �����r��e�᪺�Ů�
+void trim(char *str)
+{
+    char *end;
+    while(isspace(*str)) str++;
+    if(*str == 0) return;
+    end = str + strlen(str) - 1;
+    while(end > str && isspace(*end)) end--;
+    end[1] = '\0';
+}
+//void displayOriginal(Student **array, int length)
+//{
+//    printf("\n��l��ƦC���G\n\n");    
+//    printf("�m�W\t\t\t\t�^��\t�ƾ�\n");
+//    printf("---------------------------------------------\n");
+//    for(int i = 0; i < length; i++) {
+//        printf("%d.\t%-16s\t%d\t%d\n\n", i+1, array[i]->name, array[i]->eng, array[i]->math);
+//    }
+//    printf("---------------------------------------------\n");
+//}//�p�G�Q�b�Ƨǫ���٦�switch,�N��U���������� 
+
+void displayOriginal()
+{
+    //Student *
+	current = head;
+    printf("\n��l��ƦC���G\n\n");    
+    printf("�m�W\t\t\t\t�^��\t�ƾ�\n");
+    printf("---------------------------------------------\n");
+    for(int i = 0; current != NULL; i++) {
+        printf("%d.\t%-16s\t%d\t%d\n\n", i+1, current->name, current->eng, current->math);
+        current = current->next;
+    }
+    printf("---------------------------------------------\n");
+}
+// �ƧǨ��
+void bubble_name()
+{
+    int length = 0;
+    Student *current = head;
+    // �p���������
+    while(current != NULL) 
+	{
+        length++;
+        current = current->next;
+    }
+    // �Ыث��w�Ʋ�
+    Student **array = (Student**)malloc(length * sizeof(Student*));
+    current = head;
+    for(int i = 0; i < length; i++) 
+	{
+        array[i] = current;
+        current = current->next;
+    }
+    // ��ܭ�l���
+    //displayOriginal(array, length);
+    // ���W�r�Ƨ�
+    for(int i = 0; i < length-1; i++) 
+	{
+        for(int j = 0; j < length-1-i; j++) 
+		{
+            if(strcmp(array[j]->name, array[j+1]->name) > 0) 
+			{
+                Student *temp = array[j];
+                array[j] = array[j+1];
+                array[j+1] = temp;
+            }
+        }
+    }
+    
+    // ��ܱƧǫ᪺���G
+    printf("�ǥ͸�ƦC��(�̦W�r�Ƨ�)�G\n\n");    
+    printf("�m�W\t\t\t\t�^��\t�ƾ�\n");
+    printf("---------------------------------------------\n");
+    for(int i = 0; i < length; i++) {
+        printf("%d.\t%-16s\t%d\t%d\n\n", i+1, array[i]->name, array[i]->eng, array[i]->math);
+    }
+    printf("---------------------------------------------\n");
+    
+    free(array);
+}
+
+// ���^�妨�Z�Ƨ�
+void bubble_eng()
+{
+    int length = 0;
+    Student *current = head;
+    
+    // �p���������
+    while(current != NULL) {
+        length++;
+        current = current->next;
+    }
+    
+    // �Ыث��w�Ʋ�
+    Student **array = (Student**)malloc(length * sizeof(Student*));
+    current = head;
+    for(int i = 0; i < length; i++) {
+        array[i] = current;
+        current = current->next;
+    }
+    
+    // ��ܭ�l���
+    //displayOriginal(array, length);
+    
+    // ���^�妨�Z�Ƨ�
+    for(int i = 0; i < length-1; i++) {
+        for(int j = 0; j < length-1-i; j++) {
+            if(array[j]->eng < array[j+1]->eng) {
+                Student *temp = array[j];
+                array[j] = array[j+1];
+                array[j+1] = temp;
+            }
+        }
+    }
+    
+    // ��ܱƧǫ᪺���G
+    printf("�ǥ͸�ƦC��(�̭^�妨�Z�Ƨ�)�G\n\n");    
+    printf("�m�W\t\t\t\t�^��\t�ƾ�\n");
+    printf("---------------------------------------------\n");
+    for(int i = 0; i < length; i++) {
+        printf("%d.\t%-16s\t%d\t%d\n\n", i+1, array[i]->name, array[i]->eng, array[i]->math);
+    }
+    printf("---------------------------------------------\n");
+    
+    free(array);
+}
+
+// ���ƾǦ��Z�Ƨ�
+void bubble_math()
+{
+    int length = 0;
+    Student *current = head;
+    
+    // �p���������
+    while(current != NULL) {
+        length++;
+        current = current->next;
+    }
+    
+    // �Ыث��w�Ʋ�
+    Student **array = (Student**)malloc(length * sizeof(Student*));
+    current = head;
+    for(int i = 0; i < length; i++) {
+        array[i] = current;
+        current = current->next;
+    }
+    
+    // ��ܭ�l���
+    //displayOriginal(array, length);
+    
+    // ���ƾǦ��Z�Ƨ�
+    for(int i = 0; i < length-1; i++) {
+        for(int j = 0; j < length-1-i; j++) {
+            if(array[j]->math < array[j+1]->math) {
+                Student *temp = array[j];
+                array[j] = array[j+1];
+                array[j+1] = temp;
+            }
+        }
+    }
+    
+    // ��ܱƧǫ᪺���G
+    printf("�ǥ͸�ƦC��(�̼ƾǦ��Z�Ƨ�)�G\n\n");    
+    printf("�m�W\t\t\t\t�^��\t�ƾ�\n");
+    printf("---------------------------------------------\n");
+    for(int i = 0; i < length; i++) {
+        printf("%d.\t%-16s\t%d\t%d\n\n", i+1, array[i]->name, array[i]->eng, array[i]->math);
+    }
+    printf("---------------------------------------------\n");
+    
+    free(array);
+}
+void select()
+{
+    Student *current=head;
+    int j;
+    printf("�п�ܬd�ݲĴX�W�����\n\n");   
+    scanf("%d",&j);     
+    for(int i=1;i<j;i++)
+    {
+        current=current->next;
+    }
+    printf("\n%d. Name = %s  Eng = %d\tMath = %d",j,current->name,current->eng,current->math);
+}
+
+int main() 
+{    
+    FILE *file;
+    char line[100];
+    char name[40];
+    int eng, math;
+    char op; 
+    
+    file = fopen("YunTechStudents.txt", "r");
+    while(fgets(line, sizeof(line), file))
+    {  
+        if(strstr(line, "****") != NULL)
+            break;
+        if(sscanf(line, "%[^\t]%d%d", name, &eng, &math) == 3)
+        {    
+            trim(name);
+            addToList(name, eng, math);
+        }
+    }
+    displayList();
+    displayList_inverse();
+
+    while(fgets(line, sizeof(line), file))
+    {
+        op = line[0];
+        if(op == '+' || op == '-')
+        {
+            char fullname[40];
+            if(sscanf(line + 1, " %[^0-9]%d%d", fullname, &eng, &math) == 3)
+            {
+                trim(fullname);
+                if(op == '+')
+                {
+                    addToList(fullname, eng, math);
+                    printf("\n�s�W��Ƭ�:\t%s\t%d\t%d\n\n", fullname, eng, math);
+                }
+                else
+                {
+                    deletedate(fullname, eng, math);
+                    printf("\n�R����Ƭ�:\t%s\t%d\t%d\n\n", fullname, eng, math);
+                }
+                displayList();
+                displayList_inverse();
+            }
+        }
+    }
+    
+    int choice;
+    while(1)
+    {    
+        printf("\n\n�п�J���\n\n");
+        printf("1. �H�W�r�ƦC\t2. �H�^����ƱƦC\t3. �H�ƾǤ��ƱƦC\t4. ��ܭ쥻���\t5. ���}\n\n");      
+        scanf("%d",&choice);  
+        switch(choice)
+        {
+            case 1: 
+                bubble_name();           
+                select();
+                break;
+            case 2: 
+                bubble_eng();
+                select();
+                break;
+            case 3:
+                bubble_math(); 
+                select();
+                break;
+            case 4:              
+			    displayOriginal();
+                break;
+            case 5:              
+                printf("\n�w��A��");
+                cleanup();
+                exit(0);   
+                break;
+        }
+    }
+    fclose(file);
+    return 0;
+}
diff --git a/作業/unit4/DS4/sheng_v2.exe b/作業/unit4/DS4/sheng_v2.exe
new file mode 100644
index 0000000..980373e
Binary files /dev/null and b/作業/unit4/DS4/sheng_v2.exe differ
diff --git a/作業/unit4/DS4_try.c b/作業/unit4/DS4_try.c
new file mode 100644
index 0000000..ba46a16
--- /dev/null
+++ b/作業/unit4/DS4_try.c
@@ -0,0 +1,315 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+
+#define MAX_NAME_LENGTH 24
+
+FILE* file; 
+
+// �w�q�ǥ͸`�I���c
+typedef struct Student {
+    char name[MAX_NAME_LENGTH];
+    int english;
+    int math;
+    struct Student* llink;
+    struct Student* rlink;
+} Student;
+Student *head, *tail, *current, *prev, *temp;
+
+//�]�@�� head�A�N���k�쵲�ҫ��V����
+void init_f() {
+    head = (Student *) malloc(sizeof(Student));  // ������ head
+    head->llink = head;    // ���쵲���V�ۤv
+    head->rlink = head;    // �k�쵲���V�ۤv
+    tail = head;   
+}
+
+// �b�������J�s�ǥ͸`�I
+void insertStudent(char* name, int english, int math) {
+
+    Student* newNode = (Student*)malloc(sizeof(Student));
+	strcpy(newNode->name, name);
+	
+    newNode->english = english;
+    newNode->math = math;
+
+	if(head->rlink == tail) {
+        // �o�O�Ĥ@�Ӵ��J���`�I
+        head->rlink = newNode;
+        tail->llink = newNode;
+        newNode->llink = head;
+        newNode->rlink = tail;
+    } else {
+    	//���O�Ĥ@�� ���J����  
+        newNode->llink = tail->llink;  
+        newNode->rlink = tail;         
+        tail->llink->rlink = newNode;  
+        tail->llink = newNode;
+    }
+}
+
+// ����**�᪺�W�[�δ�ָ�� 
+void modify_list(){
+	char name[MAX_NAME_LENGTH];
+    int english, math;
+	char line[100];
+	
+//	while(fgets(line, sizeof(line), file)!=NULL){
+//		if(line[0]=='+'){
+//			sscanf(line+2, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+//			printf("\n*******************************\n");
+//	    	printf("�W�[�@�����\n\n");
+//	    	printf("%s\n",name);
+//	    	add_data(name, english, math);
+//	    	printStudentList();
+//		}else if(line[0]=='-'){
+//			sscanf(line+2, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+//			printf("\n*******************************\n");
+//	    	printf("��֤@�����\n\n");
+//	    	printf("%s\n",name);
+//	    	remove_data(name);
+//	    	printStudentList();
+//	    }
+//	}
+	fclose(file);
+}
+
+//�W�[��� 
+void add_data(char* name, int english, int math){
+	Student* newNode = (Student*)malloc(sizeof(Student));
+	strcpy(newNode->name, name);
+	
+    newNode->english = english;
+    newNode->math = math;
+    
+    newNode->llink = tail->llink;  
+    newNode->rlink = tail;         
+    tail->llink->rlink = newNode;  
+    tail->llink = newNode;
+    printf("%s �w�W�[\n", name);
+}
+
+//��ָ�� 
+void remove_data(char* name){
+
+	prev = head;
+    current = head->rlink;
+    
+	while(current!=tail &&strcmp(name,current->name)!=0){
+		prev=current;
+		current=current->rlink;
+	}
+	if(current != head){
+		
+		current->rlink->llink = prev;
+		prev->rlink = current->rlink;
+		printf("%s �w�Q�R��\n", name);
+		free(current);
+	}else  /* �䤣���ƫh��ܿ��~ */
+        printf(" %s ���b��C��\n", name);
+	
+}
+
+// �q���Ū���ǥ͸��
+void readStudentsFromFile(char* filename) {
+    file = fopen(filename, "r");
+    if (file == NULL) {
+        printf("�L�k�}���ɮ� %s\n", filename);
+        return;
+    }
+
+    char line[100];
+    int lineCount = 0;
+
+    // ���L�e�|��
+    // ��|�� 
+    while (lineCount < 4 && fgets(line, sizeof(line), file)) {
+        lineCount++;
+    }
+
+    // Ū���ǥ͸��
+    char name[MAX_NAME_LENGTH];
+    int english, math;
+	// %23[^\t]���uŪ���̦h23�Ӧr�šA����J��\t����v ^���D ���O\t�NŪ 
+	// �Y���\Ū�����Ʒ|�^��3 �YŪ������ �uŪ��name�ΨSŪ���ƫh�^�ǭȤ�����3 
+	while(fgets(line, sizeof(line), file)!=NULL){
+		if(isalpha(line[0])){
+			sscanf(line, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+			insertStudent(name, english, math);
+		}else if(line[0]=='*'){
+			break;
+		}
+	}
+}
+
+// �C�L�ǥͦC��
+void printStudentList() {
+	
+	Student* current = head->rlink;
+	printf("�q�Y�}�l\n");
+    printf("\n�m�W\t\t�^��\t�ƾ�\n");
+	printf("--------------------------------\n");
+	
+    while (current != tail) {
+        printf("%-15s\t%d\t%d\n", current->name, current->english, current->math);
+        current = current->rlink;
+    }
+    
+    current = tail->llink;
+    
+    printf("\n�q���}�l\n");	
+    printf("\n�m�W\t\t�^��\t�ƾ�\n");
+    printf("--------------------------------\n");
+    while (current != head) {
+        printf("%-15s\t%d\t%d\n", current->name, current->english, current->math);
+        current = current->llink;
+    }
+}
+
+void sort_name(){ 
+	Student* temp ;
+	Student* current;
+	
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(strcmp(current->name,temp->name) < 0){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+	print("�H�W�r�Ƨ�\n"); 
+//	printStudentList();
+} 
+
+
+void sort_eng(){ 
+	Student* temp ;
+	Student* current;
+	
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->english < temp->english){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+	print("�H�^�妨�Z�Ƨ�\n"); 
+//	printStudentList();
+}
+
+void sort_math(){ 
+	Student* temp ;
+	Student* current;
+	
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->math < temp->math){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+	print("�H�ƾǦ��Z�Ƨ�\n"); 
+//	printStudentList();
+} 
+
+
+int main() {
+    init_f();
+    readStudentsFromFile("YunTechStudents.txt");
+//    printStudentList();
+    modify_list();
+
+	sort_name();
+
+	sort_math();
+	
+	sort_eng();
+	
+	
+    return 0;
+}
diff --git a/作業/unit4/DS4_try.o b/作業/unit4/DS4_try.o
new file mode 100644
index 0000000..086f7ac
Binary files /dev/null and b/作業/unit4/DS4_try.o differ
diff --git a/作業/unit4/DS4_v2(try).c b/作業/unit4/DS4_v2(try).c
new file mode 100644
index 0000000..dc43368
--- /dev/null
+++ b/作業/unit4/DS4_v2(try).c
@@ -0,0 +1,472 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#include <conio.h> 	
+
+#define MAX_NAME_LENGTH 24
+
+//�ŧi�禡�쫬 
+void init_f();
+void insertStudent(char* name, int english, int math);
+void modify_list();
+void add_data(char* name, int english, int math);
+void remove_data(char* name);
+void readStudentsFromFile(char* filename);
+void printStudentList();
+void sort_name();
+void sort_eng();
+void sort_math();
+void choose_subject();
+void find_student(int number , int mode);
+
+// �w�q�ǥ͸`�I���c
+typedef struct Student {
+    char name[MAX_NAME_LENGTH];
+    int english;
+    int math;
+    struct Student* llink;
+    struct Student* rlink;
+} Student;
+
+Student *head, *tail, *current, *prev, *temp;
+FILE* file; 
+
+//�]�@�� head�A�N���k�쵲�ҫ��V����
+void init_f() {
+    head = (Student *) malloc(sizeof(Student));  // ������ head
+    head->llink = head;    // ���쵲���V�ۤv
+    head->rlink = head;    // �k�쵲���V�ۤv
+    tail = head;   
+}
+
+// �b�������J�s�ǥ͸`�I
+void insertStudent(char* name, int english, int math) {
+
+    Student* newNode = (Student*)malloc(sizeof(Student));
+	strcpy(newNode->name, name);
+	
+    newNode->english = english;
+    newNode->math = math;
+
+	if(head->rlink == tail) {
+        // �o�O�Ĥ@�Ӵ��J���`�I
+        head->rlink = newNode;
+        tail->llink = newNode;
+        newNode->llink = head;
+        newNode->rlink = tail;
+    } else {
+    	//���O�Ĥ@�� ���J����  
+        newNode->llink = tail->llink;  
+        newNode->rlink = tail;         
+        tail->llink->rlink = newNode;  
+        tail->llink = newNode;
+    }
+}
+
+// ����***�᪺�W�[�δ�ָ�� 
+void modify_list(){
+	char name[MAX_NAME_LENGTH];
+    int english, math;
+	char line[100];
+	
+	while(fgets(line, sizeof(line), file)!=NULL){
+		if(line[0]=='+'){
+			sscanf(line+2, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+			printf("\n*******************************\n");
+	    	printf("�W�[�@�����\n\n");
+	    	add_data(name, english, math);
+	    	printStudentList();
+		}else if(line[0]=='-'){
+			sscanf(line+2, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+			printf("\n*******************************\n");
+	    	printf("�R���@�����\n\n");
+	    	remove_data(name);
+	    	printStudentList();
+	    }
+	}
+	fclose(file);
+}
+
+//�W�[��� 
+void add_data(char* name, int english, int math){
+	Student* newNode = (Student*)malloc(sizeof(Student));
+	strcpy(newNode->name, name);
+	
+    newNode->english = english;
+    newNode->math = math;
+    
+    newNode->llink = tail->llink;  
+    newNode->rlink = tail;         
+    tail->llink->rlink = newNode;  
+    tail->llink = newNode;
+    printf("%s �w�W�[\n\n", name);
+}
+
+//��ָ�� 
+void remove_data(char* name){
+
+	prev = head;
+    current = head->rlink;
+    
+	while(current!=tail &&strcmp(name,current->name)!=0){
+		prev=current;
+		current=current->rlink;
+	}
+	if(current != tail){
+		
+		current->rlink->llink = prev;
+		prev->rlink = current->rlink;
+		printf("%s �w�R��\n\n", name);
+		free(current);
+	}else  /* �䤣���ƫh��ܿ��~ */
+        printf(" %s ���b��C��\n", name);
+	
+}
+
+// �q���Ū���ǥ͸��
+void readStudentsFromFile(char* filename) {
+    file = fopen(filename, "r");
+    if (file == NULL) {
+        printf("�L�k�}���ɮ� %s\n", filename);
+        return;
+    }
+
+    char line[100];
+    int lineCount = 0;
+
+    // ���L�e�|��
+    while (lineCount < 4 && fgets(line, sizeof(line), file)) {
+        lineCount++;
+    }
+
+    // Ū���ǥ͸��
+    char name[MAX_NAME_LENGTH];
+    int english, math;
+	// %[ ]���ܭnŪ�J�@�Ӧr�Ŷ��X  
+	// %23[^\t]���uŪ���̦h23�Ӧr�šA����J��\t����v ^���D ���O\t�NŪ 
+	// �Y���\Ū�����Ʒ|�^��3 �YŪ������ �uŪ��name�ΨSŪ���ƫh�^�ǭȤ�����3 
+	while(fgets(line, sizeof(line), file)!=NULL){
+		if(isalpha(line[0])){
+			sscanf(line, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+			insertStudent(name, english, math);
+		}else if(line[0]=='*'){
+			break;
+		}
+	}
+//	��flocse�����ե� ���`�ϥ����bmodify_list������ 
+//	fclose(file);
+}
+
+// �C�L�ǥͦC��
+void printStudentList() {
+	
+	current = head->rlink;
+	
+	printf("\n�q�Y�}�l\n");
+    printf("\n�m�W\t\t�^��\t�ƾ�\n");
+	printf("--------------------------------\n");
+	
+    while (current != tail) {
+        printf("%-15s\t%d\t%d\n", current->name, current->english, current->math);
+        current = current->rlink;
+    }
+    
+    current = tail->llink;
+    
+    printf("\n�q���}�l\n");	
+    printf("\n�m�W\t\t�^��\t�ƾ�\n");
+    printf("--------------------------------\n");
+    while (current != head) {
+        printf("%-15s\t%d\t%d\n", current->name, current->english, current->math);
+        current = current->llink;
+    }
+}
+
+//�̷ӦW�r�i��Ƨ� 
+void sort_name(){ 
+
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(strcmp(current->name,temp->name) > 0){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+//�̷ӭ^�妨�Z�i��Ƨ� 
+void sort_eng(){ 
+
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->english < temp->english){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+}
+
+//�̷ӭ^�妨�Z�i��Ƨ� 
+void sort_math(){ 
+
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->math < temp->math){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+//��ܬ�ؤαƦW 
+void choose_subject() {
+    int subject, number;
+    char mode;
+    
+    printf("\n��J��ܪ����\n"
+           "1 �ƾ� 2 �^�� ==> ");
+    mode = getche();
+    
+    if (mode != '1' && mode != '2') {
+        printf("\n��J���~\n");
+        return;
+    }
+    
+    printf("\n��J�ƦW(��J�����Ы�Enter) ==> ");
+    scanf("%d", &number);
+    
+    // �ھڿ�ܪ���ضi��Ƨ�
+    if (mode == '1') {
+        sort_math();
+    } else {
+        sort_eng();
+    }
+    
+    find_student(number, mode - '0');
+    
+    // ��ܧ���ƦW�C��
+    printf("\n���Ҧp�U");
+    printf("\n�ƦW\t�m�W\t\t�^��\t�ƾ�");
+    printf("\n-----------------------------------\n");
+    
+    current = head->rlink;
+    int actualRank = 1;    // ��ڱƦW�]�Ҽ{�P���^
+    int position = 1;      // ��m�p��
+    int prevScore = -1;    // �e�@�Ӥ���
+    
+    while (current != tail) {
+        int currentScore;
+        if (mode == '1') {
+            currentScore = current->math;
+        } else {
+            currentScore = current->english;
+        }
+        
+        // �p�G���e���ƻP�e�@�Ӥ��Ƥ��P�A��s��ڱƦW�����e��m
+        if (currentScore != prevScore) {
+            actualRank = position;
+        }
+        
+        printf("%d\t%-15s\t%d\t%d\n", 
+               actualRank,
+               current->name, 
+               current->english, 
+               current->math);
+        
+        prevScore = currentScore;
+        position++;        // ��m�û��[1
+        current = current->rlink;
+    }
+}
+
+
+//�ھڬ�ؤαƦW��ǥ� 
+void find_student(int number, int mode) {
+    current = head->rlink;
+    int actualRank = 1;    // ��ڱƦW
+    int position = 1;      // ��m�p��
+    int prevScore = -1;    // �e�@�Ӥ���
+    
+    printf("\n*****************************\n");
+    printf("%s�ƦW��%d���ǥͬ��G\n\n", 
+           (mode == 1) ? "�ƾ�" : "�^��", number);
+    printf("�m�W\t\t�^��\t�ƾ�\n");
+    
+    // �M��Ĥ@����ƪ����ơA��l��prevScore
+    if (current != tail) {
+        prevScore = (mode == 1) ? current->math : current->english;
+    }
+    
+    while (current != tail) {
+        int currentScore = (mode == 1) ? current->math : current->english;
+        
+        // �p�G���e���ƻP�e�@�Ӥ��Ƥ��P�A��s��ڱƦW
+        if (currentScore != prevScore) {
+            actualRank = position;
+        }
+        
+        // �p�G���ؼбƦW�A�L�X�ӥ͸��
+        if (actualRank == number) {
+            printf("%-15s\t%d\t%d\n", 
+                   current->name,
+                   current->english,
+                   current->math);
+        }
+        
+        prevScore = currentScore;
+        position++;
+        current = current->rlink;
+    }
+    printf("*****************************\n");
+}
+
+//����Ҧ��`�I 
+void freeAllNodes() {
+    current = head->rlink;
+    while (current != tail) {
+        Student* temp = current;
+        current = current->rlink;
+        free(temp);
+    }
+    free(head);  // ���� head �`�I
+}
+
+int main() {
+	char mode ,sort_mode;
+    init_f();
+    readStudentsFromFile("YunTechStudents.txt");
+    printStudentList();
+    modify_list();
+	
+	while(1){
+		printf("\n******* ��ܶi��ƧǩάO�ƦW��n�W���ǥ� *******\n"
+			   "*--------------------------------------*\n"
+			   "* 1 �i��Ƨ�   2 ��ܱƦW��n�W���ǥ�   3 ���� *\n"
+			   "\n�п�ܥ\\�� ==> "); //������ �\\�� �b�������|�ܶýX 
+		mode = getche();
+		switch(mode){
+			case '1':
+				printf("\n\n��ܱƧǤ覡\n"
+			   	"*--------------------------------------*\n"
+			   	"1 �W�r   2 �^�妨�Z   3 �ƾǦ��Z \n"
+			   	"\n�п�ܱƧǤ覡 ==> "); 
+				sort_mode = getche();
+				switch(sort_mode){
+					case '1':
+						printf("\n\n�H�W�r�i��Ƨ�\n");
+						sort_name();
+						printStudentList();
+						break;
+					case '2':
+						printf("\n\n�H�^�妨�Z�i��Ƨ�\n");
+						sort_eng();	
+						printStudentList();
+						break;
+					case '3':
+						printf("\n\n�H�ƾǦ��Z�i��Ƨ�\n");
+						sort_math();
+						printStudentList();
+						break;
+					default:
+						printf("\n��J���~\n");
+						break;
+					} 
+					break;
+			case '2':
+				choose_subject();
+				break;
+			case '3':
+				printf("\n\n���¨ϥΡABye~\n");
+				freeAllNodes();
+				return 0;
+			default:
+				printf("\n��J���~\n");
+				break;
+		} 
+	}
+}
diff --git a/作業/unit4/DS4_v2(try).exe b/作業/unit4/DS4_v2(try).exe
new file mode 100644
index 0000000..766c99a
Binary files /dev/null and b/作業/unit4/DS4_v2(try).exe differ
diff --git a/作業/unit4/Doubly Linked List.c b/作業/unit4/Doubly Linked List.c
new file mode 100644
index 0000000..f13198d
--- /dev/null
+++ b/作業/unit4/Doubly Linked List.c	
@@ -0,0 +1,75 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+// �w�q�`�I���c
+typedef struct Node {
+    int data;
+    struct Node* prev;
+    struct Node* next;
+} Node;
+
+// �w�q���V�쵲��C���c
+typedef struct {
+    Node* head;
+    Node* tail;
+} DoublyLinkedList;
+
+// ��l�����V�쵲��C
+void initList(DoublyLinkedList* list) {
+    list->head = NULL;
+    list->tail = NULL;
+}
+
+// �b�������J�s�`�I
+void insertAtTail(DoublyLinkedList* list, int data) {
+    Node* newNode = (Node*)malloc(sizeof(Node));
+    newNode->data = data;
+    newNode->next = NULL;
+
+    if (list->tail == NULL) {
+        newNode->prev = NULL;
+        list->head = newNode;
+        list->tail = newNode;
+    } else {
+        newNode->prev = list->tail;
+        list->tail->next = newNode;
+        list->tail = newNode;
+    }
+}
+
+// �q�Y����M���æL�X��C
+void printListForward(DoublyLinkedList* list) {
+    Node* current = list->head;
+    printf("�q�Y���: ");
+    while (current != NULL) {
+        printf("%d ", current->data);
+        current = current->next;
+    }
+    printf("\n");
+}
+
+// �q�����Y�M���æL�X��C
+void printListBackward(DoublyLinkedList* list) {
+    Node* current = list->tail;
+    printf("�q�����Y: ");
+    while (current != NULL) {
+        printf("%d ", current->data);
+        current = current->prev;
+    }
+    printf("\n");
+}
+
+// �D��ƥܨ�
+int main() {
+    DoublyLinkedList list;
+    initList(&list);
+
+    insertAtTail(&list, 10);
+    insertAtTail(&list, 20);
+    insertAtTail(&list, 30);
+
+    printListForward(&list);
+    printListBackward(&list);
+
+    return 0;
+}
diff --git a/作業/unit4/Doubly Linked List.o b/作業/unit4/Doubly Linked List.o
new file mode 100644
index 0000000..a4a69e8
Binary files /dev/null and b/作業/unit4/Doubly Linked List.o differ
diff --git a/作業/unit4/Makefile.win b/作業/unit4/Makefile.win
new file mode 100644
index 0000000..4140a50
--- /dev/null
+++ b/作業/unit4/Makefile.win
@@ -0,0 +1,28 @@
+# Project: Project9
+# Makefile created by Dev-C++ 5.11
+
+CPP      = g++.exe
+CC       = gcc.exe
+WINDRES  = windres.exe
+OBJ      = slist.o
+LINKOBJ  = slist.o
+LIBS     = -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib" -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/lib" -static-libgcc
+INCS     = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include"
+CXXINCS  = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include/c++"
+BIN      = Project.exe
+CXXFLAGS = $(CXXINCS) 
+CFLAGS   = $(INCS) 
+RM       = rm.exe -f
+
+.PHONY: all all-before all-after clean clean-custom
+
+all: all-before $(BIN) all-after
+
+clean: clean-custom
+	${RM} $(OBJ) $(BIN)
+
+$(BIN): $(OBJ)
+	$(CC) $(LINKOBJ) -o $(BIN) $(LIBS)
+
+slist.o: slist.c
+	$(CC) -c slist.c -o slist.o $(CFLAGS)
diff --git a/作業/unit4/Project.dev b/作業/unit4/Project.dev
new file mode 100644
index 0000000..1647df6
--- /dev/null
+++ b/作業/unit4/Project.dev
@@ -0,0 +1,65 @@
+[Project]
+FileName=Project.dev
+Name=Project9
+Type=1
+Ver=2
+ObjFiles=
+Includes=
+Libs=
+PrivateResource=
+ResourceIncludes=
+MakeIncludes=
+Compiler=
+CppCompiler=
+Linker=
+IsCpp=0
+Icon=
+ExeOutput=
+ObjectOutput=
+LogOutput=
+LogOutputEnabled=0
+OverrideOutput=0
+OverrideOutputName=
+HostApplication=
+UseCustomMakefile=0
+CustomMakefile=
+CommandLine=
+Folders=
+IncludeVersionInfo=0
+SupportXPThemes=0
+CompilerSet=0
+CompilerSettings=0000000000000000000000000
+UnitCount=1
+
+[VersionInfo]
+Major=1
+Minor=0
+Release=0
+Build=0
+LanguageID=1033
+CharsetID=1252
+CompanyName=
+FileVersion=
+FileDescription=Developed using the Dev-C++ IDE
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=
+AutoIncBuildNr=0
+SyncProduct=1
+
+[Unit2]
+FileName=DS4.c
+
+[Unit1]
+FileName=sList-v3.c
+CompileCpp=0
+Folder=
+Compile=1
+Link=1
+Priority=1000
+OverrideBuildCmd=0
+BuildCmd=
+
diff --git a/作業/unit4/Project.exe b/作業/unit4/Project.exe
new file mode 100644
index 0000000..9751eb6
Binary files /dev/null and b/作業/unit4/Project.exe differ
diff --git a/作業/unit4/Project.layout b/作業/unit4/Project.layout
new file mode 100644
index 0000000..ea6ebd6
--- /dev/null
+++ b/作業/unit4/Project.layout
@@ -0,0 +1,13 @@
+[Editor_0]
+CursorCol=1
+CursorRow=106
+TopLine=67
+LeftChar=1
+[Editor_1]
+CursorCol=1
+CursorRow=1
+TopLine=1
+LeftChar=1
+[Editors]
+Order=0
+Focused=-1
diff --git a/作業/unit4/Student.c b/作業/unit4/Student.c
new file mode 100644
index 0000000..c18bc4a
--- /dev/null
+++ b/作業/unit4/Student.c
@@ -0,0 +1,109 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define MAX_NAME_LENGTH 24
+
+// �w�q�ǥ͸`�I���c
+typedef struct StudentNode {
+    char name[MAX_NAME_LENGTH];
+    int english;
+    int math;
+    struct StudentNode* prev;
+    struct StudentNode* next;
+} StudentNode;
+
+// �w�q���V�쵲��C���c
+typedef struct {
+    StudentNode* head;
+    StudentNode* tail;
+} StudentList;
+
+// ��l�ƾǥͦC��
+void initList(StudentList* list) {
+    list->head = NULL;
+    list->tail = NULL;
+}
+
+// �b�������J�s�ǥ͸`�I
+void insertStudent(StudentList* list, char* name, int english, int math) {
+	int i=0;
+    StudentNode* newNode = (StudentNode*)malloc(sizeof(StudentNode));
+	while(name[i]!='\0'){
+		newNode->name[i] = name[i];
+//		printf("%c",name[i]);
+		i++;
+	}
+	newNode->name[i] = '\0';
+	
+    newNode->english = english;
+    newNode->math = math;
+    newNode->next = NULL;
+
+    if (list->tail == NULL) {
+        newNode->prev = NULL;
+        list->head = newNode;
+        list->tail = newNode;
+    } else {
+        newNode->prev = list->tail;
+        list->tail->next = newNode;
+        list->tail = newNode;
+    }
+}
+
+// �q���Ū���ǥ͸��
+void readStudentsFromFile(StudentList* list, const char* filename) {
+    FILE* file = fopen(filename, "r");
+    if (file == NULL) {
+        printf("�L�k�}���ɮ� %s\n", filename);
+        return;
+    }
+
+    char line[100];
+    int lineCount = 0;
+
+    // ���L�e�|��
+    // ��|�� 
+    while (lineCount < 4 && fgets(line, sizeof(line), file)) {
+        lineCount++;
+    }
+
+    // Ū���ǥ͸��
+    char name[MAX_NAME_LENGTH];
+    int english, math;
+    while (fscanf(file, "%49[^\t]\t%d\t%d\n", name, &english, &math) == 3) {
+        insertStudent(list, name, english, math);
+    }
+
+    fclose(file);
+}
+
+// �C�L�ǥͦC��
+void printStudentList(StudentList* list) {
+    StudentNode* current_head = list->head;
+    StudentNode* current_tail = list->tail;
+    printf("�m�W\t\t�^��\t�ƾ�\n");
+	printf("�q�Y�}�l\n");
+	printf("--------------------------------\n");
+    while (current_head != NULL) {
+        printf("%-15s\t%d\t%d\n", current_head->name, current_head->english, current_head->math);
+        current_head = current_head->next;
+    }
+    
+    printf("\n�q���}�l\n");	
+    printf("--------------------------------\n");
+    while (current_tail != NULL) {
+        printf("%-15s\t%d\t%d\n", current_tail->name, current_tail->english, current_tail->math);
+        current_tail = current_tail->prev;
+    }
+}
+
+int main() {
+    StudentList list;
+    initList(&list);
+
+    readStudentsFromFile(&list, "YunTechStudents.txt");
+    printStudentList(&list);
+
+    return 0;
+}
diff --git a/作業/unit4/Student.o b/作業/unit4/Student.o
new file mode 100644
index 0000000..8146559
Binary files /dev/null and b/作業/unit4/Student.o differ
diff --git a/作業/unit4/TWICE.c b/作業/unit4/TWICE.c
new file mode 100644
index 0000000..3cb7093
--- /dev/null
+++ b/作業/unit4/TWICE.c
@@ -0,0 +1,316 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+
+#define MAX_NAME_LENGTH 24
+
+FILE* file; 
+
+// �w�q�ǥ͸`�I���c
+typedef struct Student {
+    char name[MAX_NAME_LENGTH];
+    int english;
+    int math;
+    struct Student* llink;
+    struct Student* rlink;
+} Student;
+Student *head, *tail, *current, *prev, *temp;
+
+//�]�@�� head�A�N���k�쵲�ҫ��V����
+void init_f() {
+    head = (Student *) malloc(sizeof(Student));  // ������ head
+    head->llink = head;    // ���쵲���V�ۤv
+    head->rlink = head;    // �k�쵲���V�ۤv
+    tail = head;   
+}
+
+// �b�������J�s�ǥ͸`�I
+void insertStudent(char* name, int english, int math) {
+
+    Student* newNode = (Student*)malloc(sizeof(Student));
+	strcpy(newNode->name, name);
+	
+    newNode->english = english;
+    newNode->math = math;
+
+	if(head->rlink == tail) {
+        // �o�O�Ĥ@�Ӵ��J���`�I
+        head->rlink = newNode;
+        tail->llink = newNode;
+        newNode->llink = head;
+        newNode->rlink = tail;
+    } else {
+    	//���O�Ĥ@�� ���J����  
+        newNode->llink = tail->llink;  
+        newNode->rlink = tail;         
+        tail->llink->rlink = newNode;  
+        tail->llink = newNode;
+    }
+}
+
+// ����**�᪺�W�[�δ�ָ�� 
+void modify_list(){
+	char name[MAX_NAME_LENGTH];
+    int english, math;
+	char line[100];
+	
+	while(fgets(line, sizeof(line), file)!=NULL){
+		if(line[0]=='+'){
+			sscanf(line+2, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+			printf("\n*******************************\n");
+	    	printf("�W�[�@�����\n\n");
+	    	printf("%s\n",name);
+	    	add_data(name, english, math);
+	    	printStudentList();
+		}else if(line[0]=='-'){
+			sscanf(line+2, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+			printf("\n*******************************\n");
+	    	printf("��֤@�����\n\n");
+	    	printf("%s\n",name);
+	    	remove_data(name);
+	    	printStudentList();
+	    }
+	}
+	fclose(file);
+}
+
+//�W�[��� 
+void add_data(char* name, int english, int math){
+	Student* newNode = (Student*)malloc(sizeof(Student));
+	strcpy(newNode->name, name);
+	
+    newNode->english = english;
+    newNode->math = math;
+    
+    newNode->llink = tail->llink;  
+    newNode->rlink = tail;         
+    tail->llink->rlink = newNode;  
+    tail->llink = newNode;
+    printf("%s �w�W�[\n", name);
+}
+
+//��ָ�� 
+void remove_data(char* name){
+
+	prev = head;
+    current = head->rlink;
+    
+	while(current!=tail &&strcmp(name,current->name)!=0){
+		prev=current;
+		current=current->rlink;
+	}
+	if(current != head){
+		
+		current->rlink->llink = prev;
+		prev->rlink = current->rlink;
+		printf("%s �w�Q�R��\n", name);
+		free(current);
+	}else  /* �䤣���ƫh��ܿ��~ */
+        printf(" %s ���b��C��\n", name);
+	
+}
+
+// �q���Ū���ǥ͸��
+void readStudentsFromFile(char* filename) {
+    file = fopen(filename, "r");
+    if (file == NULL) {
+        printf("�L�k�}���ɮ� %s\n", filename);
+        return;
+    }
+
+    char line[100];
+    int lineCount = 0;
+
+    // ���L�e�|��
+    // ��|�� 
+    while (lineCount < 4 && fgets(line, sizeof(line), file)) {
+        lineCount++;
+    }
+
+    // Ū���ǥ͸��
+    char name[MAX_NAME_LENGTH];
+    int english, math;
+	// %23[^\t]���uŪ���̦h23�Ӧr�šA����J��\t����v ^���D ���O\t�NŪ 
+	// �Y���\Ū�����Ʒ|�^��3 �YŪ������ �uŪ��name�ΨSŪ���ƫh�^�ǭȤ�����3 
+	while(fgets(line, sizeof(line), file)!=NULL){
+		if(isalpha(line[0])){
+			sscanf(line, "%23[^\t]\t%d\t%d\n", name, &english, &math);
+			insertStudent(name, english, math);
+		}else if(line[0]=='*'){
+			break;
+		}
+	}
+	fclose(file);
+}
+
+// �C�L�ǥͦC��
+void printStudentList() {
+	
+	Student* current = head->rlink;
+	printf("�q�Y�}�l\n");
+    printf("\n�m�W\t\t�^��\t�ƾ�\n");
+	printf("--------------------------------\n");
+	
+    while (current != tail) {
+        printf("%-15s\t%d\t%d\n", current->name, current->english, current->math);
+        current = current->rlink;
+    }
+    
+    current = tail->llink;
+    
+    printf("\n�q���}�l\n");	
+    printf("\n�m�W\t\t�^��\t�ƾ�\n");
+    printf("--------------------------------\n");
+    while (current != head) {
+        printf("%-15s\t%d\t%d\n", current->name, current->english, current->math);
+        current = current->llink;
+    }
+}
+
+void sort_name(){ 
+	Student* temp ;
+	Student* current;
+	
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(strcmp(current->name,temp->name) < 0){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+	print("�H�W�r�Ƨ�\n"); 
+//	printStudentList();
+} 
+
+
+void sort_eng(){ 
+	Student* temp ;
+	Student* current;
+	
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->english < temp->english){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+	print("�H�^�妨�Z�Ƨ�\n"); 
+//	printStudentList();
+}
+
+void sort_math(){ 
+	Student* temp ;
+	Student* current;
+	
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->math < temp->math){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+	print("�H�ƾǦ��Z�Ƨ�\n"); 
+//	printStudentList();
+} 
+
+
+int main() {
+    init_f();
+    readStudentsFromFile("YunTechStudents.txt");
+//    printStudentList();
+//    modify_list();
+
+	sort_name();
+
+	sort_math();
+	
+	sort_eng();
+	
+	
+    return 0;
+}
diff --git a/作業/unit4/TWICE.o b/作業/unit4/TWICE.o
new file mode 100644
index 0000000..1fc8660
Binary files /dev/null and b/作業/unit4/TWICE.o differ
diff --git a/作業/unit4/Untitled11 b/作業/unit4/Untitled11
new file mode 100644
index 0000000..e69de29
diff --git a/作業/unit4/YunTechStudents.txt b/作業/unit4/YunTechStudents.txt
new file mode 100644
index 0000000..665b05c
--- /dev/null
+++ b/作業/unit4/YunTechStudents.txt
@@ -0,0 +1,18 @@
+YunTech EE Department (2024)
+======================================
+Name		English	Math		
+---------------+-------+--------------
+Steve Jobs	50	60
+Tom Cruise	30	40
+Marie Jane	70	80
+Barrack Obama	46	77
+John Tyler	98	96
+U. S. Grant	97	88
+Robert Redford	22	33
+Bruce Lee	90	90
+**************************************
++ Oliver Hardy	90	80
++ Slim Pickens	88	82
+- Marie Jane	0	0
++ James Bond	88	82
+- Barrack Obama	0	0
\ No newline at end of file
diff --git a/作業/unit4/YunTechStudents2.txt b/作業/unit4/YunTechStudents2.txt
new file mode 100644
index 0000000..ceade09
--- /dev/null
+++ b/作業/unit4/YunTechStudents2.txt
@@ -0,0 +1,20 @@
+YunTech EE Department (2024)
+======================================
+Name		English	Math		
+---------------+-------+--------------
+Steve Jobs	50	60
+Tom Cruise	30	40
+Marie Jane	70	80
+Barrack Obama	46	77
+John Tyler	98	96
+U. S. Grant	97	88
+Robert Redford	22	33
+Bruce Lee	90	90
+**************************************
+- Steve Jobs	0	0
++ Oliver Hardy	90	80
++ Slim Pickens	88	82
+- Marie Jane	0	0
++ James Bond	88	82
+- Barrack Obama	0	0
+- James Bond	0	0
\ No newline at end of file
diff --git a/作業/unit4/dlist.c b/作業/unit4/dlist.c
new file mode 100644
index 0000000..2f97c80
--- /dev/null
+++ b/作業/unit4/dlist.c
@@ -0,0 +1,185 @@
+/* file name: dList.c */
+/* ���V�䵲��C���[�J�P�R�� */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+void init_f(void);     /* ��l�Ʀ�C�A�إߤ@�Ÿ`�I�� head */
+void insert_f(void);   /* ���J��� */
+void sort_f(void);     /* �ƧǨ�� */
+void delete_f(void);   /* �R����� */
+void display_f(void);  /* ��X��� */
+void modify_f(void);   /* �ק��� */
+void flushBuffer(void);
+
+struct Student {
+    char name[20];         /* �m�W */
+    int score;             /* ���� */
+    struct Student *llink;  /* �`�I���쵲 */
+    struct Student *rlink;  /* �`�I�k�쵲 */
+};
+struct Student *ptr, *head, *tail, *current, *prev, *temp;
+
+int main(void)
+{
+    char option1;
+
+    init_f();
+    while(1) {
+        printf("\n���V�쵲��C���B�@���\n");
+        printf("************\n");
+        printf("   1.insert\n");
+        printf("   2.delete\n");
+        printf("   3.display\n");
+        printf("   4.modify\n");
+        printf("   5.quit\n");
+        printf("*************\n");
+        printf("�п�J�ﶵ(1-5): ");
+        option1 = getchar();
+        flushBuffer();
+        switch (option1) {
+            case '1':
+                insert_f();
+                break;
+            case '2':
+                delete_f();
+                break;
+            case '3':
+                display_f();
+                break;
+            case '4':
+                modify_f();
+                break;
+            case '5':
+                printf("\n�{������\n");
+                exit(0);
+        }
+    }
+    return 0;
+}
+
+void init_f(void)  /* �]�@�� head�A�N���k�쵲�ҫ��V���� */
+{
+    ptr = (struct Student *) malloc(sizeof(struct Student));
+    strcpy(ptr->name, "0");
+    ptr->llink = ptr;
+    ptr->rlink = ptr;
+    head = ptr;
+    tail = ptr;
+}
+
+void insert_f(void)
+{
+    ptr = (struct Student *) malloc(sizeof(struct Student));
+    printf("\n �m�W: ");
+    scanf("%s", ptr->name);
+    printf(" ���Z: ");
+    scanf("%d", &ptr->score);
+    flushBuffer();
+    
+    /* �H���ư��C�ƦC */
+    prev = head;
+    current = head->rlink;
+    while (current != head && current->score > ptr->score) {
+        prev = current;
+        current = current->rlink;
+    }
+    ptr->rlink = current;
+    ptr->llink = prev;
+    prev->rlink = ptr;
+    current->llink = ptr;
+}
+
+void delete_f(void)
+{
+    char del_name[20];
+    printf("\n ���R���m�W: ");
+    scanf("%s", del_name);
+    flushBuffer();
+    prev = head;
+    current = head->rlink;
+    while (current != head && strcmp(del_name, current->name) != 0) {
+        prev = current;
+        current = current->rlink;
+    }
+    if (current != head) {
+        prev->rlink = current->rlink;
+        current->rlink->llink = prev;
+        printf(" %s �w�Q�R��\n", del_name);
+        free(current);
+    }
+    else  /* �䤣���ƫh��ܿ��~ */
+        printf(" %s ���b��C��\n", del_name);
+}
+
+void modify_f(void)
+{
+    char n_temp[20];
+    printf("\n ���ק諸�m�W: ");
+    scanf("%s", n_temp);
+    prev = head;
+    current = head->rlink;
+    while (current != head && strcmp(n_temp, current->name)) {
+        prev = current;
+        current = current->rlink;
+    }
+    if (current == head) {
+        printf(" %s �S���b��C��\n", n_temp);
+    }
+    else {
+        printf(" ******************\n");
+        printf("  �m�W : %s\n", current->name);
+        printf("  ����: %d\n", current->score);
+        printf(" ******************\n");
+        printf(" �п�J�s������: ");
+        scanf("%d", &current->score);
+        flushBuffer();
+        printf(" %s �w�Q�ק�\n", n_temp);
+        //�N�ק諸�`�I�[�J��A������m
+        //���N current ���`�I���w�� temp�A�í��s�վ㥪�B�k�`�I
+        temp = current;
+        prev->rlink = current->rlink;
+        current->rlink->llink = prev;
+        //�A�N temp �`�I�[�J���C��
+        /* �H���ư��C�ƦC */
+        prev = head;
+        current = head->rlink;
+        while (current != head && current->score > temp->score) {
+            prev = current;
+            current = current->rlink;
+        }
+        temp->rlink = current;
+        temp->llink = prev;
+        prev->rlink = temp;
+        current->llink = temp;
+    }
+}
+
+void display_f(void)
+{
+    int count = 0;
+    if (head->rlink == head) {
+        printf("\n ��C�L���\n");
+    }
+    else {
+        printf("\n");
+        printf("  NAME           SCORE\n");
+        printf(" ----------------------\n");
+        current = head->rlink;
+        while (current != head) {
+            printf("  %-15s %3d\n", current->name, current->score);
+            count++;
+            current = current->rlink;
+        }
+        printf(" ----------------------\n");
+        printf(" �`�@�� %d �����\n", count);
+    }
+}
+
+void flushBuffer(void)
+{
+    while(getchar() != '\n')
+        continue;
+}
+
diff --git a/作業/unit4/list.txt b/作業/unit4/list.txt
new file mode 100644
index 0000000..f02855b
--- /dev/null
+++ b/作業/unit4/list.txt
@@ -0,0 +1,9 @@
+1	jeff	80
+2	tim	90
+3	jack	84
+4	sam	85
+5	poson	76
+6	dan	14
+7	ren	40
+8	eric	96
+9	ben	36
diff --git a/作業/unit4/sList-v2.zip b/作業/unit4/sList-v2.zip
new file mode 100644
index 0000000..d82d5bf
Binary files /dev/null and b/作業/unit4/sList-v2.zip differ
diff --git a/作業/unit4/sList-v2/list.txt b/作業/unit4/sList-v2/list.txt
new file mode 100644
index 0000000..f02855b
--- /dev/null
+++ b/作業/unit4/sList-v2/list.txt
@@ -0,0 +1,9 @@
+1	jeff	80
+2	tim	90
+3	jack	84
+4	sam	85
+5	poson	76
+6	dan	14
+7	ren	40
+8	eric	96
+9	ben	36
diff --git a/作業/unit4/sList-v2/sList-v2.c b/作業/unit4/sList-v2/sList-v2.c
new file mode 100644
index 0000000..0a7bf2f
--- /dev/null
+++ b/作業/unit4/sList-v2/sList-v2.c
@@ -0,0 +1,272 @@
+/* sList.c */
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+/* �w�q�@���V FILE ������ */
+FILE *fptr;
+
+/* �禡���쫬�ŧi */
+void init_f(void);
+void insertStudent(int id, char* name, double score);
+void readFromFile(const char* filename);
+void saveToFile(const char* filename);
+void insert(void);
+void del(void);
+void modify(void);
+void display(void);
+
+// �w�q�ǥ͸`�I���c
+typedef struct Student {
+	long int id;
+    char name[10];
+    double score;
+    struct Student *rlink;
+    struct Student *llink;
+} Student;
+Student *head, *pNode ,*tail, *current, *prev, *temp ;
+
+//�]�@�� head�A�N���k�쵲�ҫ��V����
+void init_f() {
+    head = (Student *) malloc(sizeof(Student));
+    tail = (Student *) malloc(sizeof(Student));
+    
+    // ��l�� head �M tail
+    head->llink = NULL;
+    head->rlink = tail;
+    
+    tail->llink = head;
+    tail->rlink = NULL;
+}
+
+// �b�������J�s�ǥ͸`�I
+void insertStudent(int id, char* name, double score) {
+
+    Student* newNode = (Student*)malloc(sizeof(Student));
+	
+	
+    newNode->id = id;
+    strcpy(newNode->name, name);
+    newNode->name[9] = '\0';
+    newNode->score = score;
+
+    // ���J��������e
+    newNode->rlink = tail;
+    newNode->llink = tail->llink;
+    tail->llink->rlink = newNode;
+    tail->llink = newNode;
+}
+
+// Ū�� 
+void readFromFile(const char* filename) {
+	char line[100];
+    FILE* fptr = fopen(filename, "r");
+    if (fptr == NULL) {
+        printf("�L�k���}�ɮ� %s\n", filename);
+        return;
+    }
+    
+    long int id;
+    char name[10];
+    double score;
+    while(fgets(line ,sizeof(line) ,fptr)!=NULL){
+    	if(sscanf(line,"%ld\t%9s\t%lf", &id, name, &score) == 3){
+    		insertStudent(id, name, score);
+		}
+	}
+    fclose(fptr);
+    printf("����ɮ׸��\n");
+}
+
+// �s�� 
+void saveToFile(const char* filename ) {
+    FILE* fptr = fopen(filename, "w");
+    if (fptr == NULL) {
+        printf("�L�k���}�ɮ� %s �i��g�J\n", filename);
+        return;
+    }
+    	Student* current = head->rlink;
+    	while (current != tail ) {
+	        fprintf(fptr, "%ld\t%s\t%.lf\n", current->id, current->name, current->score);
+	        current = current->rlink;
+	}
+    
+    fclose(fptr);
+    printf("��Ƥw���\\�x�s�� %s\n", filename);
+}
+
+//��ܦ�C��� 
+void printStudentList() {
+	
+	Student* current = head->rlink;
+	printf("\n*******************************");
+	
+    if (current != NULL) {
+        printf("\n%6s %10s %8s\n", "ID", "Name", "Score");
+        printf("-------------------------------\n");
+        while (current != tail) {
+            printf("%6ld %10s %8.1f\n", current->id,current->name, current->score);
+            /* �N���в���U�@�Ӹ`�I */
+            current = current->rlink;
+        	}
+    	}
+    	/* �Y�O�Ū��A�h��X�쵲��C�L��� */
+    	else {
+    	    printf("\n�쵲��C�L���\n");
+    	}
+    printf("*******************************\n\n");
+}
+
+int main(){
+	init_f();
+	readFromFile("list.txt");
+	printStudentList();
+    /* �Q�Τ@������ϥο�ܥ\�ඵ�� */
+    int choice;
+    do {
+    	printf("************************\n");
+        printf("�쵲��C���B�@���\n");
+        printf("1. �[�J�@�`�I\n");
+        printf("2. �R���@�`�I\n");
+        printf("3. �ק�@�`�I\n");
+        printf("4. ��ܩҦ��`�I\n");     
+        printf("5. ����\n");
+        printf("��: ");
+        scanf("%d", &choice);
+        switch (choice) {
+            case 1:
+                insert();
+                break;
+            case 2:
+                del();
+                break;
+            case 3:
+                modify();
+                break;
+            case 4:
+                printStudentList();
+                break;
+            case 5:
+            	printf("\n�{������\n");
+                saveToFile("list.txt");
+                exit(0);
+            default:
+                printf("��J���X�����T�A���s��J\n");  
+        }
+        printf("\n");
+    } while(choice != 5);
+    getchar();
+    return 0;
+}
+
+/* ���Ӥ��ƥѤj�ܤp�[�J�@�`�I���쵲��C */
+void insert()
+{
+    /* �Q�� malloc() �禡�t�m�O����*/
+    Student* newNode = (Student*)malloc(sizeof(Student));
+
+    printf("\n�п�JID: ");
+    scanf("%ld", &newNode->id);
+    printf("�п�J�m�W: ");
+    scanf("%s", newNode->name);
+    printf("�п�J����: ");
+    scanf("%lf", &newNode->score);
+    
+    /* �[�J�@�`�I���쵲��C */
+    current = head->rlink;
+    prev = head;
+    
+    // ���J��������e
+    newNode->rlink = tail;
+    newNode->llink = tail->llink;
+    tail->llink->rlink = newNode;
+    tail->llink = newNode;
+}
+
+/* �R���Y�@�`�I*/
+void del()
+{
+    long int deleteID;
+    /* �N current ���Ы��V head ���U�@�Ӹ`�I */
+    current = head->rlink;
+    prev = head;
+    /* ���P�_�쵲��C�O�_���� */
+    if (current != NULL) {
+        /* �Y���O�Ū��A�h��M���R�����`�I */
+        printf("\n�п�J���R���� ID: ");
+        scanf("%ld", &deleteID);
+        /* ��M���R�����`�I */
+        while ((current != tail) && (current->id != deleteID)) {
+            prev = current;
+            current = current->rlink;
+        }
+        /* �Y���A�h�N���R�� */
+        if (current != tail) {
+			current->rlink->llink = prev;
+			prev->rlink = current->rlink;
+            printf("ID: %ld �w�R��\n", current->id);
+
+            free(current);
+        }
+        /* �Y�S�����A�h��X�䤣����R���`�I���T��*/
+        else {
+            printf("\n�䤣����R�����`�I\n");
+        }
+    }
+    /* �Y�O�Ū��A�h��X�쵲��C�O�Ū��T�� */
+    else {
+        printf("�쵲��C�O�Ū�\n");
+    }
+}
+
+/* �ק�Y�@�`�I */
+void modify()
+{
+    Student *temp;
+    long int modifyID;
+    double modifyScore;
+    int flag = 0;
+    printf("\n�п�J���ק�`�I�� ID: ");
+    scanf("%ld", &modifyID);
+    current = head->rlink;
+    prev = head;
+    
+    /* ��M���ק諸�`�I */
+    while (current != tail) {
+        if (current->id == modifyID) {
+            printf("�ثe���ק�`�I����Ʀp�U:\n");
+            printf("%6ld %10s %8.1f\n\n", current->id,current->name, current->score);
+            printf("�п�J���ק諸����: ");
+            scanf("%lf", &modifyScore);
+            current->score = modifyScore;
+            flag = 1;
+            break;
+        }
+        else {
+            prev = current;
+            current = current->rlink;
+        }
+    }
+    /* �P�_�O�_�������ק諸�`�I */
+    if (flag != 0) {
+        /* �N current ���`�I���w�� temp */
+//        temp = current;
+//        prev->rlink = current->rlink;
+        /* �N temp �`�I�[�J���쵲��C */
+//        current = head->rlink;
+//        prev = head;
+//        while ((current != tail) && (temp->score < current->score)) {
+//            prev = current;
+//            current = current->rlink;
+//        }
+//        prev->rlink = temp;
+//        temp->rlink = current;
+    }
+    else {
+        printf("�䤣����ק諸�`�I\n");
+    }
+}
+
+
+
+
diff --git a/作業/unit4/sList-v3.c b/作業/unit4/sList-v3.c
new file mode 100644
index 0000000..36e8829
--- /dev/null
+++ b/作業/unit4/sList-v3.c
@@ -0,0 +1,449 @@
+/* sList.c */
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+/* �w�q�@���V FILE ������ */
+FILE *fptr;
+
+/* �禡���쫬�ŧi */
+void init_f(void);
+void insertStudent(int id, char* name, double score);
+void readFromFile(const char* filename);
+void saveToFile(const char* filename, int flag);
+void insert(void);
+void del(void);
+void modify(void);
+void display(void);
+
+// �w�q�ǥ͸`�I���c
+typedef struct Student {
+	long int id;
+    char name[10];
+    double score;
+    struct Student *rlink;
+    struct Student *llink;
+} Student;
+Student *head, *pNode ,*tail, *current, *prev, *temp , *originalHead ,*originalTail;
+
+//�]�@�� head�A�N���k�쵲�ҫ��V����
+void init_f() {
+    head = (Student *) malloc(sizeof(Student));
+    tail = (Student *) malloc(sizeof(Student));
+    
+    // ��l�� head �M tail
+    head->llink = NULL;
+    head->rlink = tail;
+    
+    tail->llink = head;
+    tail->rlink = NULL;
+    
+    // ��l�ƭ�l���Ǧ�C
+    originalHead = (Student *) malloc(sizeof(Student));
+    originalTail = (Student *) malloc(sizeof(Student));
+    
+    originalHead->llink = NULL;
+    originalHead->rlink = originalTail;
+    originalTail->llink = originalHead;
+    originalTail->rlink = NULL;
+}
+
+// �b�������J�s�ǥ͸`�I
+void insertStudent(int id, char* name, double score) {
+
+    Student* newNode = (Student*)malloc(sizeof(Student));
+	
+	
+    newNode->id = id;
+    strcpy(newNode->name, name);
+    newNode->name[9] = '\0';
+    newNode->score = score;
+
+    // ���J��������e
+    newNode->rlink = tail;
+    newNode->llink = tail->llink;
+    tail->llink->rlink = newNode;
+    tail->llink = newNode;
+}
+
+/* �s�W��ơG���J�`�I���l���Ǧ�C */
+void insertOriginalList(int id, char* name, double score) {
+    Student* newNode = (Student*)malloc(sizeof(Student));
+    
+    newNode->id = id;
+    strncpy(newNode->name, name, 9);
+    newNode->name[9] = '\0';
+    newNode->score = score;
+
+    // ���J���l��C�������e
+    newNode->rlink = originalTail;
+    newNode->llink = originalTail->llink;
+    originalTail->llink->rlink = newNode;
+    originalTail->llink = newNode;
+}
+
+// Ū�� 
+void readFromFile(const char* filename) {
+	char line[100];
+    FILE* fptr = fopen(filename, "r");
+    if (fptr == NULL) {
+        printf("�L�k���}�ɮ� %s\n", filename);
+        return;
+    }
+    
+    long int id;
+    char name[10];
+    double score;
+    while(fgets(line ,sizeof(line) ,fptr)!=NULL){
+    	if(sscanf(line,"%ld\t%9s\t%lf", &id, name, &score) == 3){
+    		insertStudent(id, name, score);
+    		insertOriginalList(id, name, score);  // ���J��l���Ǧ�C
+		}
+	}
+    fclose(fptr);
+    printf("����ɮ׸��\n");
+}
+
+// �s�� 
+void saveToFile(const char* filename , int flag) {
+    FILE* fptr = fopen(filename, "w");
+    if (fptr == NULL) {
+        printf("�L�k���}�ɮ� %s �i��g�J\n", filename);
+        return;
+    }
+    
+    if(flag == 2){
+    	Student* current = head->rlink;
+    	while (current != tail ) {
+	        fprintf(fptr, "%ld\t%s\t%.lf\n", current->id, current->name, current->score);
+	        current = current->rlink;
+	    	}
+	}else if(flag == 1){
+		Student* current = originalHead->rlink;
+    	while (current != originalTail ) {
+	        fprintf(fptr, "%ld\t%s\t%.lf\n", current->id, current->name, current->score);
+	        current = current->rlink;
+	    	}
+	}
+    
+    
+    fclose(fptr);
+    printf("��Ƥw���\\�x�s�� %s\n", filename);
+}
+
+//��ܦ�C��� 
+void printStudentList() {
+	
+	Student* current = head->rlink;
+	printf("\n*******************************");
+	
+    if (current != NULL) {
+        printf("\n%6s %10s %8s\n", "ID", "Name", "Score");
+        printf("-------------------------------\n");
+        while (current != tail) {
+            printf("%6ld %10s %8.1f\n", current->id,current->name, current->score);
+            /* �N���в���U�@�Ӹ`�I */
+            current = current->rlink;
+        	}
+    	}
+    	/* �Y�O�Ū��A�h��X�쵲��C�L��� */
+    	else {
+    	    printf("\n�쵲��C�L���\n");
+    	}
+    printf("*******************************\n\n");
+}
+
+/* �s�W��ܭ�l���Ǹ�ƪ���� */
+void printOriginalList() {
+    Student* current = originalHead->rlink;
+    printf("\n*******************************");
+    
+    if (current != originalTail) {
+        printf("\n%6s %10s %8s\n", "ID", "Name", "Score");
+        printf("-------------------------------\n");
+        while (current != originalTail) {
+            printf("%6ld %10s %8.1f\n", current->id, current->name, current->score);
+            current = current->rlink;
+        }
+    } else {
+        printf("\n�쵲��C�L���\n");
+    }
+    printf("*******************************\n\n");
+}
+
+void sort_id(){ 
+	Student* temp ;
+	Student* current;
+	
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->id > temp->id){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+void sort_score(){ 
+	Student* temp;
+	Student* current;
+	
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->score < temp->score){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+int main(){
+	init_f();
+	readFromFile("list.txt");
+	printStudentList();
+    int flag = 0;
+    /* �Q�Τ@������ϥο�ܥ\�ඵ�� */
+    int choice;
+    do {
+    	printf("************************\n");
+        printf("�쵲��C���B�@���\n");
+        printf("1. �[�J�@�`�I\n");
+        printf("2. �R���@�`�I\n");
+        printf("3. �ק�@�`�I\n");
+        printf("4. ��ܩҦ��`�I\n");
+        printf("5. ��ܭ�l��J���쪺���\n");
+        printf("6. ��ܦ��Z�Ѱ��ܧC�ƦC\n");
+        printf("7. ���ID�Ѥp��j�ƦC\n");
+        
+        printf("8. ����\n");
+        printf("��: ");
+        scanf("%d", &choice);
+        switch (choice) {
+            case 1:
+                insert();
+                break;
+            case 2:
+                del();
+                break;
+            case 3:
+                modify();
+                break;
+            case 4:
+                printStudentList();
+                break;
+            case 5:
+            	printOriginalList();
+            	flag = 1;
+                break;
+            case 6:    
+                sort_score();
+                printStudentList();
+                flag = 2;
+                break;
+            case 7:
+            	sort_id();
+                printStudentList();
+                flag = 2;
+                break;
+			case 8:
+				printf("\n�{������\n");
+                saveToFile("list.txt",flag);
+                exit(0);
+            default:
+                printf("��J���X�����T�A���s��J\n");  
+        }
+        printf("\n");
+    } while(choice != 8);
+    getchar();
+    return 0;
+}
+
+/* ���Ӥ��ƥѤj�ܤp�[�J�@�`�I���쵲��C */
+void insert()
+{
+    /* �Q�� malloc() �禡�t�m�O����*/
+    Student* newNode = (Student*)malloc(sizeof(Student));
+
+    printf("\n�п�JID: ");
+    scanf("%ld", &newNode->id);
+    printf("�п�J�m�W: ");
+    scanf("%s", newNode->name);
+    printf("�п�J����: ");
+    scanf("%lf", &newNode->score);
+    
+    /* �[�J�@�`�I���쵲��C */
+    current = head->rlink;
+    prev = head;
+    
+    // ���J��������e
+    newNode->rlink = tail;
+    newNode->llink = tail->llink;
+    tail->llink->rlink = newNode;
+    tail->llink = newNode;
+    
+    // ���J��l���Ǧ�C
+    insertOriginalList(newNode->id, newNode->name, newNode->score);
+}
+
+void deleteFromOriginalList(long int deleteID) {
+    Student* current = originalHead->rlink;
+    Student* prev = originalHead;
+    
+    while (current != originalTail) {
+        if (current->id == deleteID) {
+            current->rlink->llink = prev;
+            prev->rlink = current->rlink;
+            free(current);
+            break;
+        }
+        prev = current;
+        current = current->rlink;
+    }
+}
+
+/* �R���Y�@�`�I*/
+void del()
+{
+    long int deleteID;
+    /* �N current ���Ы��V head ���U�@�Ӹ`�I */
+    current = head->rlink;
+    prev = head;
+    /* ���P�_�쵲��C�O�_���� */
+    if (current != NULL) {
+        /* �Y���O�Ū��A�h��M���R�����`�I */
+        printf("\n�п�J���R���� ID: ");
+        scanf("%ld", &deleteID);
+        /* ��M���R�����`�I */
+        while ((current != tail) && (current->id != deleteID)) {
+            prev = current;
+            current = current->rlink;
+        }
+        /* �Y���A�h�N���R�� */
+        if (current != tail) {
+			current->rlink->llink = prev;
+			prev->rlink = current->rlink;
+            printf("ID: %ld �w�R��\n", current->id);
+            
+            deleteFromOriginalList(deleteID);
+            
+            free(current);
+        }
+        /* �Y�S�����A�h��X�䤣����R���`�I���T��*/
+        else {
+            printf("\n�䤣����R�����`�I\n");
+        }
+    }
+    /* �Y�O�Ū��A�h��X�쵲��C�O�Ū��T�� */
+    else {
+        printf("�쵲��C�O�Ū�\n");
+    }
+}
+
+/* �ק�Y�@�`�I */
+void modify()
+{
+    Student *temp;
+    long int modifyID;
+    double modifyScore;
+    int flag = 0;
+    printf("\n�п�J���ק�`�I�� ID: ");
+    scanf("%ld", &modifyID);
+    current = head->rlink;
+    prev = head;
+    
+    /* ��M���ק諸�`�I */
+    while (current != tail) {
+        if (current->id == modifyID) {
+            printf("�ثe���ק�`�I����Ʀp�U:\n");
+            printf("%6ld %10s %8.1f\n\n", current->id,
+                           current->name, current->score);
+            printf("�п�J���ק諸����: ");
+            scanf("%lf", &modifyScore);
+            current->score = modifyScore;
+            flag = 1;
+            break;
+        }
+        else {
+            prev = current;
+            current = current->rlink;
+        }
+    }
+    /* �P�_�O�_�������ק諸�`�I */
+    if (flag != 0) {
+        /* �N current ���`�I���w�� temp */
+        temp = current;
+        prev->rlink = current->rlink;
+        /* �N temp �`�I�[�J���쵲��C */
+        current = head->rlink;
+        prev = head;
+        while ((current != tail) && (temp->score < current->score)) {
+            prev = current;
+            current = current->rlink;
+        }
+        prev->rlink = temp;
+        temp->rlink = current;
+    }
+    else {
+        printf("�䤣����ק諸�`�I\n");
+    }
+}
+
+
+
+
diff --git a/作業/unit4/sList-v3.zip b/作業/unit4/sList-v3.zip
new file mode 100644
index 0000000..8f878e5
Binary files /dev/null and b/作業/unit4/sList-v3.zip differ
diff --git a/作業/unit4/sList-v3/list.txt b/作業/unit4/sList-v3/list.txt
new file mode 100644
index 0000000..f02855b
--- /dev/null
+++ b/作業/unit4/sList-v3/list.txt
@@ -0,0 +1,9 @@
+1	jeff	80
+2	tim	90
+3	jack	84
+4	sam	85
+5	poson	76
+6	dan	14
+7	ren	40
+8	eric	96
+9	ben	36
diff --git a/作業/unit4/sList-v3/sList-v3.c b/作業/unit4/sList-v3/sList-v3.c
new file mode 100644
index 0000000..36e8829
--- /dev/null
+++ b/作業/unit4/sList-v3/sList-v3.c
@@ -0,0 +1,449 @@
+/* sList.c */
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+/* �w�q�@���V FILE ������ */
+FILE *fptr;
+
+/* �禡���쫬�ŧi */
+void init_f(void);
+void insertStudent(int id, char* name, double score);
+void readFromFile(const char* filename);
+void saveToFile(const char* filename, int flag);
+void insert(void);
+void del(void);
+void modify(void);
+void display(void);
+
+// �w�q�ǥ͸`�I���c
+typedef struct Student {
+	long int id;
+    char name[10];
+    double score;
+    struct Student *rlink;
+    struct Student *llink;
+} Student;
+Student *head, *pNode ,*tail, *current, *prev, *temp , *originalHead ,*originalTail;
+
+//�]�@�� head�A�N���k�쵲�ҫ��V����
+void init_f() {
+    head = (Student *) malloc(sizeof(Student));
+    tail = (Student *) malloc(sizeof(Student));
+    
+    // ��l�� head �M tail
+    head->llink = NULL;
+    head->rlink = tail;
+    
+    tail->llink = head;
+    tail->rlink = NULL;
+    
+    // ��l�ƭ�l���Ǧ�C
+    originalHead = (Student *) malloc(sizeof(Student));
+    originalTail = (Student *) malloc(sizeof(Student));
+    
+    originalHead->llink = NULL;
+    originalHead->rlink = originalTail;
+    originalTail->llink = originalHead;
+    originalTail->rlink = NULL;
+}
+
+// �b�������J�s�ǥ͸`�I
+void insertStudent(int id, char* name, double score) {
+
+    Student* newNode = (Student*)malloc(sizeof(Student));
+	
+	
+    newNode->id = id;
+    strcpy(newNode->name, name);
+    newNode->name[9] = '\0';
+    newNode->score = score;
+
+    // ���J��������e
+    newNode->rlink = tail;
+    newNode->llink = tail->llink;
+    tail->llink->rlink = newNode;
+    tail->llink = newNode;
+}
+
+/* �s�W��ơG���J�`�I���l���Ǧ�C */
+void insertOriginalList(int id, char* name, double score) {
+    Student* newNode = (Student*)malloc(sizeof(Student));
+    
+    newNode->id = id;
+    strncpy(newNode->name, name, 9);
+    newNode->name[9] = '\0';
+    newNode->score = score;
+
+    // ���J���l��C�������e
+    newNode->rlink = originalTail;
+    newNode->llink = originalTail->llink;
+    originalTail->llink->rlink = newNode;
+    originalTail->llink = newNode;
+}
+
+// Ū�� 
+void readFromFile(const char* filename) {
+	char line[100];
+    FILE* fptr = fopen(filename, "r");
+    if (fptr == NULL) {
+        printf("�L�k���}�ɮ� %s\n", filename);
+        return;
+    }
+    
+    long int id;
+    char name[10];
+    double score;
+    while(fgets(line ,sizeof(line) ,fptr)!=NULL){
+    	if(sscanf(line,"%ld\t%9s\t%lf", &id, name, &score) == 3){
+    		insertStudent(id, name, score);
+    		insertOriginalList(id, name, score);  // ���J��l���Ǧ�C
+		}
+	}
+    fclose(fptr);
+    printf("����ɮ׸��\n");
+}
+
+// �s�� 
+void saveToFile(const char* filename , int flag) {
+    FILE* fptr = fopen(filename, "w");
+    if (fptr == NULL) {
+        printf("�L�k���}�ɮ� %s �i��g�J\n", filename);
+        return;
+    }
+    
+    if(flag == 2){
+    	Student* current = head->rlink;
+    	while (current != tail ) {
+	        fprintf(fptr, "%ld\t%s\t%.lf\n", current->id, current->name, current->score);
+	        current = current->rlink;
+	    	}
+	}else if(flag == 1){
+		Student* current = originalHead->rlink;
+    	while (current != originalTail ) {
+	        fprintf(fptr, "%ld\t%s\t%.lf\n", current->id, current->name, current->score);
+	        current = current->rlink;
+	    	}
+	}
+    
+    
+    fclose(fptr);
+    printf("��Ƥw���\\�x�s�� %s\n", filename);
+}
+
+//��ܦ�C��� 
+void printStudentList() {
+	
+	Student* current = head->rlink;
+	printf("\n*******************************");
+	
+    if (current != NULL) {
+        printf("\n%6s %10s %8s\n", "ID", "Name", "Score");
+        printf("-------------------------------\n");
+        while (current != tail) {
+            printf("%6ld %10s %8.1f\n", current->id,current->name, current->score);
+            /* �N���в���U�@�Ӹ`�I */
+            current = current->rlink;
+        	}
+    	}
+    	/* �Y�O�Ū��A�h��X�쵲��C�L��� */
+    	else {
+    	    printf("\n�쵲��C�L���\n");
+    	}
+    printf("*******************************\n\n");
+}
+
+/* �s�W��ܭ�l���Ǹ�ƪ���� */
+void printOriginalList() {
+    Student* current = originalHead->rlink;
+    printf("\n*******************************");
+    
+    if (current != originalTail) {
+        printf("\n%6s %10s %8s\n", "ID", "Name", "Score");
+        printf("-------------------------------\n");
+        while (current != originalTail) {
+            printf("%6ld %10s %8.1f\n", current->id, current->name, current->score);
+            current = current->rlink;
+        }
+    } else {
+        printf("\n�쵲��C�L���\n");
+    }
+    printf("*******************************\n\n");
+}
+
+void sort_id(){ 
+	Student* temp ;
+	Student* current;
+	
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->id > temp->id){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+void sort_score(){ 
+	Student* temp;
+	Student* current;
+	
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->score < temp->score){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+int main(){
+	init_f();
+	readFromFile("list.txt");
+	printStudentList();
+    int flag = 0;
+    /* �Q�Τ@������ϥο�ܥ\�ඵ�� */
+    int choice;
+    do {
+    	printf("************************\n");
+        printf("�쵲��C���B�@���\n");
+        printf("1. �[�J�@�`�I\n");
+        printf("2. �R���@�`�I\n");
+        printf("3. �ק�@�`�I\n");
+        printf("4. ��ܩҦ��`�I\n");
+        printf("5. ��ܭ�l��J���쪺���\n");
+        printf("6. ��ܦ��Z�Ѱ��ܧC�ƦC\n");
+        printf("7. ���ID�Ѥp��j�ƦC\n");
+        
+        printf("8. ����\n");
+        printf("��: ");
+        scanf("%d", &choice);
+        switch (choice) {
+            case 1:
+                insert();
+                break;
+            case 2:
+                del();
+                break;
+            case 3:
+                modify();
+                break;
+            case 4:
+                printStudentList();
+                break;
+            case 5:
+            	printOriginalList();
+            	flag = 1;
+                break;
+            case 6:    
+                sort_score();
+                printStudentList();
+                flag = 2;
+                break;
+            case 7:
+            	sort_id();
+                printStudentList();
+                flag = 2;
+                break;
+			case 8:
+				printf("\n�{������\n");
+                saveToFile("list.txt",flag);
+                exit(0);
+            default:
+                printf("��J���X�����T�A���s��J\n");  
+        }
+        printf("\n");
+    } while(choice != 8);
+    getchar();
+    return 0;
+}
+
+/* ���Ӥ��ƥѤj�ܤp�[�J�@�`�I���쵲��C */
+void insert()
+{
+    /* �Q�� malloc() �禡�t�m�O����*/
+    Student* newNode = (Student*)malloc(sizeof(Student));
+
+    printf("\n�п�JID: ");
+    scanf("%ld", &newNode->id);
+    printf("�п�J�m�W: ");
+    scanf("%s", newNode->name);
+    printf("�п�J����: ");
+    scanf("%lf", &newNode->score);
+    
+    /* �[�J�@�`�I���쵲��C */
+    current = head->rlink;
+    prev = head;
+    
+    // ���J��������e
+    newNode->rlink = tail;
+    newNode->llink = tail->llink;
+    tail->llink->rlink = newNode;
+    tail->llink = newNode;
+    
+    // ���J��l���Ǧ�C
+    insertOriginalList(newNode->id, newNode->name, newNode->score);
+}
+
+void deleteFromOriginalList(long int deleteID) {
+    Student* current = originalHead->rlink;
+    Student* prev = originalHead;
+    
+    while (current != originalTail) {
+        if (current->id == deleteID) {
+            current->rlink->llink = prev;
+            prev->rlink = current->rlink;
+            free(current);
+            break;
+        }
+        prev = current;
+        current = current->rlink;
+    }
+}
+
+/* �R���Y�@�`�I*/
+void del()
+{
+    long int deleteID;
+    /* �N current ���Ы��V head ���U�@�Ӹ`�I */
+    current = head->rlink;
+    prev = head;
+    /* ���P�_�쵲��C�O�_���� */
+    if (current != NULL) {
+        /* �Y���O�Ū��A�h��M���R�����`�I */
+        printf("\n�п�J���R���� ID: ");
+        scanf("%ld", &deleteID);
+        /* ��M���R�����`�I */
+        while ((current != tail) && (current->id != deleteID)) {
+            prev = current;
+            current = current->rlink;
+        }
+        /* �Y���A�h�N���R�� */
+        if (current != tail) {
+			current->rlink->llink = prev;
+			prev->rlink = current->rlink;
+            printf("ID: %ld �w�R��\n", current->id);
+            
+            deleteFromOriginalList(deleteID);
+            
+            free(current);
+        }
+        /* �Y�S�����A�h��X�䤣����R���`�I���T��*/
+        else {
+            printf("\n�䤣����R�����`�I\n");
+        }
+    }
+    /* �Y�O�Ū��A�h��X�쵲��C�O�Ū��T�� */
+    else {
+        printf("�쵲��C�O�Ū�\n");
+    }
+}
+
+/* �ק�Y�@�`�I */
+void modify()
+{
+    Student *temp;
+    long int modifyID;
+    double modifyScore;
+    int flag = 0;
+    printf("\n�п�J���ק�`�I�� ID: ");
+    scanf("%ld", &modifyID);
+    current = head->rlink;
+    prev = head;
+    
+    /* ��M���ק諸�`�I */
+    while (current != tail) {
+        if (current->id == modifyID) {
+            printf("�ثe���ק�`�I����Ʀp�U:\n");
+            printf("%6ld %10s %8.1f\n\n", current->id,
+                           current->name, current->score);
+            printf("�п�J���ק諸����: ");
+            scanf("%lf", &modifyScore);
+            current->score = modifyScore;
+            flag = 1;
+            break;
+        }
+        else {
+            prev = current;
+            current = current->rlink;
+        }
+    }
+    /* �P�_�O�_�������ק諸�`�I */
+    if (flag != 0) {
+        /* �N current ���`�I���w�� temp */
+        temp = current;
+        prev->rlink = current->rlink;
+        /* �N temp �`�I�[�J���쵲��C */
+        current = head->rlink;
+        prev = head;
+        while ((current != tail) && (temp->score < current->score)) {
+            prev = current;
+            current = current->rlink;
+        }
+        prev->rlink = temp;
+        temp->rlink = current;
+    }
+    else {
+        printf("�䤣����ק諸�`�I\n");
+    }
+}
+
+
+
+
diff --git a/作業/unit4/slist.c b/作業/unit4/slist.c
new file mode 100644
index 0000000..36e8829
--- /dev/null
+++ b/作業/unit4/slist.c
@@ -0,0 +1,449 @@
+/* sList.c */
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+/* �w�q�@���V FILE ������ */
+FILE *fptr;
+
+/* �禡���쫬�ŧi */
+void init_f(void);
+void insertStudent(int id, char* name, double score);
+void readFromFile(const char* filename);
+void saveToFile(const char* filename, int flag);
+void insert(void);
+void del(void);
+void modify(void);
+void display(void);
+
+// �w�q�ǥ͸`�I���c
+typedef struct Student {
+	long int id;
+    char name[10];
+    double score;
+    struct Student *rlink;
+    struct Student *llink;
+} Student;
+Student *head, *pNode ,*tail, *current, *prev, *temp , *originalHead ,*originalTail;
+
+//�]�@�� head�A�N���k�쵲�ҫ��V����
+void init_f() {
+    head = (Student *) malloc(sizeof(Student));
+    tail = (Student *) malloc(sizeof(Student));
+    
+    // ��l�� head �M tail
+    head->llink = NULL;
+    head->rlink = tail;
+    
+    tail->llink = head;
+    tail->rlink = NULL;
+    
+    // ��l�ƭ�l���Ǧ�C
+    originalHead = (Student *) malloc(sizeof(Student));
+    originalTail = (Student *) malloc(sizeof(Student));
+    
+    originalHead->llink = NULL;
+    originalHead->rlink = originalTail;
+    originalTail->llink = originalHead;
+    originalTail->rlink = NULL;
+}
+
+// �b�������J�s�ǥ͸`�I
+void insertStudent(int id, char* name, double score) {
+
+    Student* newNode = (Student*)malloc(sizeof(Student));
+	
+	
+    newNode->id = id;
+    strcpy(newNode->name, name);
+    newNode->name[9] = '\0';
+    newNode->score = score;
+
+    // ���J��������e
+    newNode->rlink = tail;
+    newNode->llink = tail->llink;
+    tail->llink->rlink = newNode;
+    tail->llink = newNode;
+}
+
+/* �s�W��ơG���J�`�I���l���Ǧ�C */
+void insertOriginalList(int id, char* name, double score) {
+    Student* newNode = (Student*)malloc(sizeof(Student));
+    
+    newNode->id = id;
+    strncpy(newNode->name, name, 9);
+    newNode->name[9] = '\0';
+    newNode->score = score;
+
+    // ���J���l��C�������e
+    newNode->rlink = originalTail;
+    newNode->llink = originalTail->llink;
+    originalTail->llink->rlink = newNode;
+    originalTail->llink = newNode;
+}
+
+// Ū�� 
+void readFromFile(const char* filename) {
+	char line[100];
+    FILE* fptr = fopen(filename, "r");
+    if (fptr == NULL) {
+        printf("�L�k���}�ɮ� %s\n", filename);
+        return;
+    }
+    
+    long int id;
+    char name[10];
+    double score;
+    while(fgets(line ,sizeof(line) ,fptr)!=NULL){
+    	if(sscanf(line,"%ld\t%9s\t%lf", &id, name, &score) == 3){
+    		insertStudent(id, name, score);
+    		insertOriginalList(id, name, score);  // ���J��l���Ǧ�C
+		}
+	}
+    fclose(fptr);
+    printf("����ɮ׸��\n");
+}
+
+// �s�� 
+void saveToFile(const char* filename , int flag) {
+    FILE* fptr = fopen(filename, "w");
+    if (fptr == NULL) {
+        printf("�L�k���}�ɮ� %s �i��g�J\n", filename);
+        return;
+    }
+    
+    if(flag == 2){
+    	Student* current = head->rlink;
+    	while (current != tail ) {
+	        fprintf(fptr, "%ld\t%s\t%.lf\n", current->id, current->name, current->score);
+	        current = current->rlink;
+	    	}
+	}else if(flag == 1){
+		Student* current = originalHead->rlink;
+    	while (current != originalTail ) {
+	        fprintf(fptr, "%ld\t%s\t%.lf\n", current->id, current->name, current->score);
+	        current = current->rlink;
+	    	}
+	}
+    
+    
+    fclose(fptr);
+    printf("��Ƥw���\\�x�s�� %s\n", filename);
+}
+
+//��ܦ�C��� 
+void printStudentList() {
+	
+	Student* current = head->rlink;
+	printf("\n*******************************");
+	
+    if (current != NULL) {
+        printf("\n%6s %10s %8s\n", "ID", "Name", "Score");
+        printf("-------------------------------\n");
+        while (current != tail) {
+            printf("%6ld %10s %8.1f\n", current->id,current->name, current->score);
+            /* �N���в���U�@�Ӹ`�I */
+            current = current->rlink;
+        	}
+    	}
+    	/* �Y�O�Ū��A�h��X�쵲��C�L��� */
+    	else {
+    	    printf("\n�쵲��C�L���\n");
+    	}
+    printf("*******************************\n\n");
+}
+
+/* �s�W��ܭ�l���Ǹ�ƪ���� */
+void printOriginalList() {
+    Student* current = originalHead->rlink;
+    printf("\n*******************************");
+    
+    if (current != originalTail) {
+        printf("\n%6s %10s %8s\n", "ID", "Name", "Score");
+        printf("-------------------------------\n");
+        while (current != originalTail) {
+            printf("%6ld %10s %8.1f\n", current->id, current->name, current->score);
+            current = current->rlink;
+        }
+    } else {
+        printf("\n�쵲��C�L���\n");
+    }
+    printf("*******************************\n\n");
+}
+
+void sort_id(){ 
+	Student* temp ;
+	Student* current;
+	
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->id > temp->id){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+void sort_score(){ 
+	Student* temp;
+	Student* current;
+	
+	//�Y�S����ƩΥu���@����� 
+	if (head->rlink == tail || head->rlink->rlink == tail) {
+        return;
+    }
+    
+	int flag = 1;
+	while(flag){
+		flag = 0;
+		current = head->rlink;
+
+		while(current->rlink != tail){
+			temp = current->rlink;
+			
+			if(current->score < temp->score){
+//				�u�ϥΨ�Ӹ`�I�i��`�I�洫 
+//				�n�`�N���Ч��ܫ᪺����
+//				�Y�U�C�{�����ǥ洫���Ы��V����}�|�X��
+//				�]�i�H�h�ŧi��Ӹ`�I ����current->llink��temp->rlink 
+//				�o�˴N�i�H�L�����޶��� 
+				temp->llink = current->llink;
+				current->rlink = temp->rlink;
+												
+				temp->rlink->llink = current;
+				temp->rlink = current;
+				
+				current->llink->rlink = temp;
+				current->llink = temp;
+				
+				flag = 1;
+			}
+			else{
+				current = current->rlink;
+			}
+		}
+	}
+} 
+
+int main(){
+	init_f();
+	readFromFile("list.txt");
+	printStudentList();
+    int flag = 0;
+    /* �Q�Τ@������ϥο�ܥ\�ඵ�� */
+    int choice;
+    do {
+    	printf("************************\n");
+        printf("�쵲��C���B�@���\n");
+        printf("1. �[�J�@�`�I\n");
+        printf("2. �R���@�`�I\n");
+        printf("3. �ק�@�`�I\n");
+        printf("4. ��ܩҦ��`�I\n");
+        printf("5. ��ܭ�l��J���쪺���\n");
+        printf("6. ��ܦ��Z�Ѱ��ܧC�ƦC\n");
+        printf("7. ���ID�Ѥp��j�ƦC\n");
+        
+        printf("8. ����\n");
+        printf("��: ");
+        scanf("%d", &choice);
+        switch (choice) {
+            case 1:
+                insert();
+                break;
+            case 2:
+                del();
+                break;
+            case 3:
+                modify();
+                break;
+            case 4:
+                printStudentList();
+                break;
+            case 5:
+            	printOriginalList();
+            	flag = 1;
+                break;
+            case 6:    
+                sort_score();
+                printStudentList();
+                flag = 2;
+                break;
+            case 7:
+            	sort_id();
+                printStudentList();
+                flag = 2;
+                break;
+			case 8:
+				printf("\n�{������\n");
+                saveToFile("list.txt",flag);
+                exit(0);
+            default:
+                printf("��J���X�����T�A���s��J\n");  
+        }
+        printf("\n");
+    } while(choice != 8);
+    getchar();
+    return 0;
+}
+
+/* ���Ӥ��ƥѤj�ܤp�[�J�@�`�I���쵲��C */
+void insert()
+{
+    /* �Q�� malloc() �禡�t�m�O����*/
+    Student* newNode = (Student*)malloc(sizeof(Student));
+
+    printf("\n�п�JID: ");
+    scanf("%ld", &newNode->id);
+    printf("�п�J�m�W: ");
+    scanf("%s", newNode->name);
+    printf("�п�J����: ");
+    scanf("%lf", &newNode->score);
+    
+    /* �[�J�@�`�I���쵲��C */
+    current = head->rlink;
+    prev = head;
+    
+    // ���J��������e
+    newNode->rlink = tail;
+    newNode->llink = tail->llink;
+    tail->llink->rlink = newNode;
+    tail->llink = newNode;
+    
+    // ���J��l���Ǧ�C
+    insertOriginalList(newNode->id, newNode->name, newNode->score);
+}
+
+void deleteFromOriginalList(long int deleteID) {
+    Student* current = originalHead->rlink;
+    Student* prev = originalHead;
+    
+    while (current != originalTail) {
+        if (current->id == deleteID) {
+            current->rlink->llink = prev;
+            prev->rlink = current->rlink;
+            free(current);
+            break;
+        }
+        prev = current;
+        current = current->rlink;
+    }
+}
+
+/* �R���Y�@�`�I*/
+void del()
+{
+    long int deleteID;
+    /* �N current ���Ы��V head ���U�@�Ӹ`�I */
+    current = head->rlink;
+    prev = head;
+    /* ���P�_�쵲��C�O�_���� */
+    if (current != NULL) {
+        /* �Y���O�Ū��A�h��M���R�����`�I */
+        printf("\n�п�J���R���� ID: ");
+        scanf("%ld", &deleteID);
+        /* ��M���R�����`�I */
+        while ((current != tail) && (current->id != deleteID)) {
+            prev = current;
+            current = current->rlink;
+        }
+        /* �Y���A�h�N���R�� */
+        if (current != tail) {
+			current->rlink->llink = prev;
+			prev->rlink = current->rlink;
+            printf("ID: %ld �w�R��\n", current->id);
+            
+            deleteFromOriginalList(deleteID);
+            
+            free(current);
+        }
+        /* �Y�S�����A�h��X�䤣����R���`�I���T��*/
+        else {
+            printf("\n�䤣����R�����`�I\n");
+        }
+    }
+    /* �Y�O�Ū��A�h��X�쵲��C�O�Ū��T�� */
+    else {
+        printf("�쵲��C�O�Ū�\n");
+    }
+}
+
+/* �ק�Y�@�`�I */
+void modify()
+{
+    Student *temp;
+    long int modifyID;
+    double modifyScore;
+    int flag = 0;
+    printf("\n�п�J���ק�`�I�� ID: ");
+    scanf("%ld", &modifyID);
+    current = head->rlink;
+    prev = head;
+    
+    /* ��M���ק諸�`�I */
+    while (current != tail) {
+        if (current->id == modifyID) {
+            printf("�ثe���ק�`�I����Ʀp�U:\n");
+            printf("%6ld %10s %8.1f\n\n", current->id,
+                           current->name, current->score);
+            printf("�п�J���ק諸����: ");
+            scanf("%lf", &modifyScore);
+            current->score = modifyScore;
+            flag = 1;
+            break;
+        }
+        else {
+            prev = current;
+            current = current->rlink;
+        }
+    }
+    /* �P�_�O�_�������ק諸�`�I */
+    if (flag != 0) {
+        /* �N current ���`�I���w�� temp */
+        temp = current;
+        prev->rlink = current->rlink;
+        /* �N temp �`�I�[�J���쵲��C */
+        current = head->rlink;
+        prev = head;
+        while ((current != tail) && (temp->score < current->score)) {
+            prev = current;
+            current = current->rlink;
+        }
+        prev->rlink = temp;
+        temp->rlink = current;
+    }
+    else {
+        printf("�䤣����ק諸�`�I\n");
+    }
+}
+
+
+
+
diff --git a/作業/unit4/slist.o b/作業/unit4/slist.o
new file mode 100644
index 0000000..1fe39c7
Binary files /dev/null and b/作業/unit4/slist.o differ
diff --git a/作業/unit4/slist_file_sort.c b/作業/unit4/slist_file_sort.c
new file mode 100644
index 0000000..d56d92a
--- /dev/null
+++ b/作業/unit4/slist_file_sort.c
@@ -0,0 +1,280 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+struct Node {
+    long int id;
+    char name[10];
+    double score;
+    struct Node *next;
+};
+
+struct LinkedList {
+    struct Node *head;
+    struct Node *tail;
+};
+
+struct Node* createNode() {
+    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
+    if (newNode == NULL) {
+        printf("�O������t����\n");
+        exit(1);
+    }
+    newNode->next = NULL;
+    return newNode;
+}
+
+void insertNode(struct LinkedList* list, long int id, const char* name, double score) {
+    struct Node* newNode = createNode();
+    newNode->id = id;
+    strncpy(newNode->name, name, 9);
+    newNode->name[9] = '\0';
+    newNode->score = score;
+    
+    if (list->head == NULL) {
+        list->head = newNode;
+        list->tail = newNode;
+    } else {
+        list->tail->next = newNode;
+        list->tail = newNode;
+    }
+}
+
+void printList(struct LinkedList* list) {
+    struct Node* current = list->head;
+    while (current != NULL) {
+        printf("�Ǹ�: %ld, �m�W: %s, ����: %.2f\n", current->id, current->name, current->score);
+        current = current->next;
+    }
+}
+
+void freeList(struct LinkedList* list) {
+    struct Node* current = list->head;
+    while (current != NULL) {
+        struct Node* temp = current;
+        current = current->next;
+        free(temp);
+    }
+    list->head = NULL;
+    list->tail = NULL;
+}
+
+//Ū�� 
+void readFromFile(struct LinkedList* list, const char* filename) {
+    FILE* file = fopen(filename, "r");
+    if (file == NULL) {
+        printf("�L�k���}�ɮ� %s\n", filename);
+        return;
+    }
+    
+    long int id;
+    char name[10];
+    int score;
+    
+    while (fscanf(file, "%ld %9s %d", &id, name, &score) == 3) {
+        insertNode(list, id, name, score);
+    }
+    
+    fclose(file);
+}
+
+void saveToFile(struct LinkedList* list, const char* filename) {
+    FILE* file = fopen(filename, "w");
+    if (file == NULL) {
+        printf("�L�k���}�ɮ� %s �i��g�J\n", filename);
+        return;
+    }
+    
+    struct Node* current = list->head;
+    while (current != NULL) {
+        fprintf(file, "%ld %s %d\n", current->id, current->name, current->score);
+        current = current->next;
+    }
+    
+    fclose(file);
+    printf("��Ƥw���\�x�s�� %s\n", filename);
+}
+
+void inputFromKeyboard(struct LinkedList* list) {
+    long int id;
+    char name[10];
+    double score;
+    
+    printf("�п�J�Ǹ�: ");
+    scanf("%ld", &id);
+    printf("�п�J�m�W (�̦h9�Ӧr��): ");
+    scanf("%9s", name);
+    printf("�п�J����: ");
+    scanf("%lf", &score);
+    
+    insertNode(list, id, name, score);
+    printf("��Ƥw���\�K�[���C��\n");
+}
+
+void deleteNode(struct LinkedList* list, long int id) {
+    struct Node* current = list->head;
+    struct Node* prev = NULL;
+
+    if (current != NULL && current->id == id) {
+        list->head = current->next;
+        free(current);
+        if (list->head == NULL) {
+            list->tail = NULL;
+        }
+        printf("�Ǹ��� %ld ����Ƥw�R��\n", id);
+        return;
+    }
+
+    while (current != NULL && current->id != id) {
+        prev = current;
+        current = current->next;
+    }
+
+    if (current == NULL) {
+        printf("�䤣��Ǹ��� %ld �����\n", id);
+        return;
+    }
+
+    prev->next = current->next;
+    if (current == list->tail) {
+        list->tail = prev;
+    }
+    free(current);
+    printf("�Ǹ��� %ld ����Ƥw�R��\n", id);
+}
+
+void copyList(struct LinkedList* source, struct LinkedList* dest) {
+    freeList(dest);
+    struct Node* current = source->head;
+    while (current != NULL) {
+        insertNode(dest, current->id, current->name, current->score);
+        current = current->next;
+    }
+}
+
+void sortByScore(struct LinkedList* list) {
+    if (list->head == NULL || list->head->next == NULL) return;
+
+    struct Node* sorted = NULL;
+    struct Node* current = list->head;
+
+    while (current != NULL) {
+        struct Node* next = current->next;
+        if (sorted == NULL || sorted->score < current->score) {
+            current->next = sorted;
+            sorted = current;
+        } else {
+            struct Node* search = sorted;
+            while (search->next != NULL && search->next->score > current->score) {
+                search = search->next;
+            }
+            current->next = search->next;
+            search->next = current;
+        }
+        current = next;
+    }
+
+    list->head = sorted;
+    while (sorted->next != NULL) {
+        sorted = sorted->next;
+    }
+    list->tail = sorted;
+}
+
+void sortById(struct LinkedList* list) {
+    if (list->head == NULL || list->head->next == NULL) return;
+
+    struct Node* sorted = NULL;
+    struct Node* current = list->head;
+
+    while (current != NULL) {
+        struct Node* next = current->next;
+        if (sorted == NULL || sorted->id > current->id) {
+            current->next = sorted;
+            sorted = current;
+        } else {
+            struct Node* search = sorted;
+            while (search->next != NULL && search->next->id < current->id) {
+                search = search->next;
+            }
+            current->next = search->next;
+            search->next = current;
+        }
+        current = next;
+    }
+
+    list->head = sorted;
+    while (sorted->next != NULL) {
+        sorted = sorted->next;
+    }
+    list->tail = sorted;
+}
+
+int main() {
+    struct LinkedList originalList = {NULL, NULL};
+    struct LinkedList scoreList = {NULL, NULL};
+    struct LinkedList idList = {NULL, NULL};
+    int choice, sortChoice;
+    long int id_to_delete;
+    const char* filename = "list.txt";
+
+    readFromFile(&originalList, filename);
+    
+    do {
+        printf("\n1. ��ܸ��\n");
+        printf("2. �q��L��J�s���\n");
+        printf("3. �R���S�w���\n");
+        printf("4. �x�s�ðh�X\n");
+        printf("�п�ܾާ@ (1-4): ");
+        scanf("%d", &choice);
+        
+        switch(choice) {
+            case 1:
+                printf("�����ܤ覡�G\n");
+                printf("1. ��l����\n");
+                printf("2. �����Z�Ƨǡ]����C�^\n");
+                printf("3. ���Ǹ��Ƨǡ]�p��j�^\n");
+                scanf("%d", &sortChoice);
+                
+                switch(sortChoice) {
+                    case 1:
+                        printf("\n��l���Ǫ����:\n");
+                        printList(&originalList);
+                        break;
+                    case 2:
+                        copyList(&originalList, &scoreList);
+                        sortByScore(&scoreList);
+                        printf("\n�����Z�ƧǪ���ơ]����C�^:\n");
+                        printList(&scoreList);
+                        break;
+                    case 3:
+                        copyList(&originalList, &idList);
+                        sortById(&idList);
+                        printf("\n���Ǹ��ƧǪ���ơ]�p��j�^:\n");
+                        printList(&idList);
+                        break;
+                    default:
+                        printf("�L�Ī����\n");
+                }
+                break;
+            case 2:
+                inputFromKeyboard(&originalList);
+                break;
+            case 3:
+                printf("�п�J�n�R�����Ǹ�: ");
+                scanf("%ld", &id_to_delete);
+                deleteNode(&originalList, id_to_delete);
+                break;
+            case 4:
+                saveToFile(&originalList, filename);
+                break;
+            default:
+                printf("�L�Ī���ܡA�Э��s��J\n");
+        }
+    } while (choice != 4);
+    
+    freeList(&originalList);
+    freeList(&scoreList);
+    freeList(&idList);
+    return 0;
+}
diff --git a/作業/unit4/slist_file_sort.exe b/作業/unit4/slist_file_sort.exe
new file mode 100644
index 0000000..096fdd0
Binary files /dev/null and b/作業/unit4/slist_file_sort.exe differ
diff --git a/作業/unit4/slist_file_sort.o b/作業/unit4/slist_file_sort.o
new file mode 100644
index 0000000..18b85b1
Binary files /dev/null and b/作業/unit4/slist_file_sort.o differ
diff --git a/作業/unit4/slist_test.c b/作業/unit4/slist_test.c
new file mode 100644
index 0000000..a11fe5a
--- /dev/null
+++ b/作業/unit4/slist_test.c
@@ -0,0 +1,77 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+struct Node {
+    long int id;
+    char name[10];
+    double score;
+    struct Node *next;
+};
+
+struct Node* createNode() {
+    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
+    if (newNode == NULL) {
+        printf("�O������t����\n");
+        exit(1);
+    }
+    newNode->next = NULL;
+    return newNode;
+}
+
+void insertNode(struct Node** head) {
+    struct Node* newNode = createNode();
+    
+    printf("�п�J�Ǹ�: ");
+    scanf("%ld", &(newNode->id));
+    
+    printf("�п�J�m�W (�̦h9�Ӧr��): ");
+    scanf("%9s", newNode->name);
+    
+    printf("�п�J����: ");
+    scanf("%lf", &(newNode->score));
+    
+    if (*head == NULL) {
+        *head = newNode;
+    } else {
+        struct Node* current = *head;
+        while (current->next != NULL) {
+            current = current->next;
+        }
+        current->next = newNode;
+    }
+    
+    printf("��ƲK�[���\\n"); 
+}
+
+void printList(struct Node* head) {
+    struct Node* current = head;
+    while (current != NULL) {
+        printf("�Ǹ�: %ld, �m�W: %s, ����: %.2f\n", current->id, current->name, current->score);
+        current = current->next;
+    }
+}
+
+int main() {
+    struct Node* head = NULL;
+    char choice;
+
+    
+    do {
+        insertNode(&head);
+        printf("�O�_�~���J? (y/n): ");
+        scanf(" %c", &choice);
+    } while (choice == 'y' || choice == 'Y');
+    
+    printf("\n��C�����Ҧ����:\n");
+    printList(head);
+    
+    // ����O����]������Τ����ӧ����{�^
+    while (head != NULL) {
+        struct Node* temp = head;
+        head = head->next;
+        free(temp);
+    }
+    
+    return 0;
+}
diff --git a/作業/unit4/slist_test.o b/作業/unit4/slist_test.o
new file mode 100644
index 0000000..25fb8ac
Binary files /dev/null and b/作業/unit4/slist_test.o differ
diff --git a/作業/unit4/slist_test_file.c b/作業/unit4/slist_test_file.c
new file mode 100644
index 0000000..1cbfdf2
--- /dev/null
+++ b/作業/unit4/slist_test_file.c
@@ -0,0 +1,188 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+struct Node {
+    long int id;
+    char name[10];
+    double score;
+    struct Node *next;
+};
+
+struct LinkedList {
+    struct Node *head;
+    struct Node *tail;
+};
+
+struct Node* createNode() {
+    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
+    if (newNode == NULL) {
+        printf("�O������t����\n");
+        exit(1);
+    }
+    newNode->next = NULL;
+    return newNode;
+}
+
+void insertNode(struct LinkedList* list, long int id, const char* name, double score) {
+    struct Node* newNode = createNode();
+    newNode->id = id;
+    strncpy(newNode->name, name, 9);
+    newNode->name[9] = '\0';
+    newNode->score = score;
+    
+    if (list->head == NULL) {
+        list->head = newNode;
+        list->tail = newNode;
+    } else {
+        list->tail->next = newNode;
+        list->tail = newNode;
+    }
+}
+
+void printList(struct LinkedList* list) {
+    struct Node* current = list->head;
+    while (current != NULL) {
+        printf("�Ǹ�: %ld, �m�W: %s, ����: %.2f\n", current->id, current->name, current->score);
+        current = current->next;
+    }
+}
+
+void freeList(struct LinkedList* list) {
+    struct Node* current = list->head;
+    while (current != NULL) {
+        struct Node* temp = current;
+        current = current->next;
+        free(temp);
+    }
+    list->head = NULL;
+    list->tail = NULL;
+}
+
+void readFromFile(struct LinkedList* list, const char* filename) {
+    FILE* file = fopen(filename, "r");
+    if (file == NULL) {
+        printf("�L�k���}�ɮ� %s\n", filename);
+        return;
+    }
+    
+    long int id;
+    char name[10];
+    double score;
+    
+    while (fscanf(file, "%ld %9s %lf", &id, name, &score) == 3) {
+        insertNode(list, id, name, score);
+    }
+    
+    fclose(file);
+}
+
+void saveToFile(struct LinkedList* list, const char* filename) {
+    FILE* file = fopen(filename, "w");
+    if (file == NULL) {
+        printf("�L�k���}�ɮ� %s �i��g�J\n", filename);
+        return;
+    }
+    
+    struct Node* current = list->head;
+    while (current != NULL) {
+        fprintf(file, "%ld %s %.2f\n", current->id, current->name, current->score);
+        current = current->next;
+    }
+    
+    fclose(file);
+    printf("��Ƥw���\�x�s�� %s\n", filename);
+}
+
+void inputFromKeyboard(struct LinkedList* list) {
+    long int id;
+    char name[10];
+    double score;
+    
+    printf("�п�J�Ǹ�: ");
+    scanf("%ld", &id);
+    printf("�п�J�m�W (�̦h9�Ӧr��): ");
+    scanf("%9s", name);
+    printf("�п�J����: ");
+    scanf("%lf", &score);
+    
+    insertNode(list, id, name, score);
+    printf("��Ƥw���\�K�[���C��\n");
+}
+
+void deleteNode(struct LinkedList* list, long int id) {
+    struct Node* current = list->head;
+    struct Node* prev = NULL;
+
+    // �p�G�n�R�����O�Y�`�I
+    if (current != NULL && current->id == id) {
+        list->head = current->next;
+        free(current);
+        if (list->head == NULL) {
+            list->tail = NULL;  // �p�G�R����C�����šA��s tail
+        }
+        printf("�Ǹ��� %ld ����Ƥw�R��\n", id);
+        return;
+    }
+
+    // �j�M�n�R�����`�I
+    while (current != NULL && current->id != id) {
+        prev = current;
+        current = current->next;
+    }
+
+    // �p�G�S���n�R�����`�I
+    if (current == NULL) {
+        printf("�䤣��Ǹ��� %ld �����\n", id);
+        return;
+    }
+
+    // �R���`�I
+    prev->next = current->next;
+    if (current == list->tail) {
+        list->tail = prev;  // �p�G�R�����O���`�I�A��s tail
+    }
+    free(current);
+    printf("�Ǹ��� %ld ����Ƥw�R��\n", id);
+}
+
+int main() {
+    struct LinkedList list = {NULL, NULL};
+    int choice;
+    long int id_to_delete;
+    const char* filename = "list.txt";
+
+    readFromFile(&list, filename);
+    
+    do {
+        printf("\n1. ��ܩҦ����\n");
+        printf("2. �q��L��J�s���\n");
+        printf("3. �R���S�w���\n");
+        printf("4. �x�s�ðh�X\n");
+        printf("�п�ܾާ@ (1-4): ");
+        scanf("%d", &choice);
+        
+        switch(choice) {
+            case 1:
+                printf("\n�Ҧ����:\n");
+                printList(&list);
+                break;
+            case 2:
+                inputFromKeyboard(&list);
+                break;
+            case 3:
+                printf("�п�J�n�R�����Ǹ�: ");
+                scanf("%ld", &id_to_delete);
+                deleteNode(&list, id_to_delete);
+                break;
+            case 4:
+                saveToFile(&list, filename);
+                break;
+            default:
+                printf("�L�Ī���ܡA�Э��s��J\n");
+        }
+    } while (choice != 4);
+    
+    freeList(&list);
+    return 0;
+}
diff --git a/作業/unit4/slist_test_file.o b/作業/unit4/slist_test_file.o
new file mode 100644
index 0000000..0bee680
Binary files /dev/null and b/作業/unit4/slist_test_file.o differ
diff --git a/作業/unit4/test.c b/作業/unit4/test.c
new file mode 100644
index 0000000..db2a2c3
--- /dev/null
+++ b/作業/unit4/test.c
@@ -0,0 +1,17 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int main()
+{
+  char str[30] = "-20.30300 This is test";
+   char *ptr;
+   double ret;
+   int i = 0;
+   ret = strtod(&str[4], &ptr);
+   int len = ptr - &str[i]; 
+   printf("�Ʀr�]double�^�O %f\n", ret);
+   printf("�r�Ŧ곡���O |%s|\n", ptr);
+   printf("len =%d ,&ptr=%d ,&str[i]=%d  ", len ,&ptr ,&str[i]);
+	
+   return(0);
+}
diff --git a/作業/unit4/test.exe b/作業/unit4/test.exe
new file mode 100644
index 0000000..f1dbccc
Binary files /dev/null and b/作業/unit4/test.exe differ
diff --git a/作業/unit4/test.o b/作業/unit4/test.o
new file mode 100644
index 0000000..09bb3f3
Binary files /dev/null and b/作業/unit4/test.o differ
diff --git a/作業/unit4/try.c b/作業/unit4/try.c
new file mode 100644
index 0000000..ba77bde
--- /dev/null
+++ b/作業/unit4/try.c
@@ -0,0 +1,290 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+// �w�q�`�I���c
+typedef struct Node {
+    int value;
+    struct Node* next;
+} Node;
+
+// �w�q�쵲��C���c
+typedef struct {
+    Node* head;
+    int length;
+    size_t memoryUsed;  // �s�W�G�l�ܰO����ϥ�
+} LinkedList;
+
+int i;
+
+// ��ƭ쫬
+Node* createNode(int value);
+void initLinkedList(LinkedList* list);
+void push(LinkedList* list, int value);
+Node* pop(LinkedList* list);
+void unshift(LinkedList* list, int value);
+Node* shift(LinkedList* list);
+void insert(LinkedList* list, int index, int value);
+Node* removeNode(LinkedList* list, int index);
+void get(LinkedList* list, int index);
+void printAll(LinkedList* list);
+void freeLinkedList(LinkedList* list);
+
+// �D���
+int main() {
+    LinkedList list;
+    initLinkedList(&list);
+    int choice, value, index;
+
+    while (1) {
+        printf("\n�쵲��C�ާ@���:\n");
+        printf("1. Push (�q�����s�W�`�I)\n");
+        printf("2. Pop (�q���������`�I)\n");
+        printf("3. Unshift (�q�Y���s�W�`�I)\n");
+        printf("4. Shift (�q�Y�������`�I)\n");
+        printf("5. Insert (�b���w��m���J�`�I)\n");
+        printf("6. Remove (�������w��m���`�I)\n");
+        printf("7. Get (������w��m���`�I��)\n");
+        printf("8. Print All (��ܩҦ��`�I)\n");
+        printf("0. �h�X\n");
+        printf("�п�J�A�����: ");
+        scanf("%d", &choice);
+
+        switch (choice) {
+            case 0:
+                printf("�{������\n");
+                freeLinkedList(&list);
+                return 0;
+            case 1:
+                printf("��J�n�s�W����: ");
+                scanf("%d", &value);
+                push(&list, value);
+                break;
+            case 2:
+                {
+                    Node* popped = pop(&list);
+                    if (popped) {
+                        printf("�u�X����: %d\n", popped->value);
+                        free(popped);
+                        list.memoryUsed -= sizeof(Node);
+                    } else {
+                        printf("��C����\n");
+                    }
+                }
+                break;
+            case 3:
+                printf("��J�n�s�W����: ");
+                scanf("%d", &value);
+                unshift(&list, value);
+                break;
+            case 4:
+                {
+                    Node* shifted = shift(&list);
+                    if (shifted) {
+                        printf("��������: %d\n", shifted->value);
+                        free(shifted);
+                    } else {
+                        printf("��C����\n");
+                    }
+                }
+                break;
+            case 5:
+                printf("��J���J��m: ");
+                scanf("%d", &index);
+                printf("��J�n���J����: ");
+                scanf("%d", &value);
+                insert(&list, index, value);
+                break;
+            case 6:
+                printf("��J�n��������m: ");
+                scanf("%d", &index);
+                {
+                    Node* removed = removeNode(&list, index);
+                    if (removed) {
+                        printf("��������: %d\n", removed->value);
+                        free(removed);
+                        list.memoryUsed -= sizeof(Node);
+                    } else {
+                        printf("�L�Ī���m\n");
+                    }
+                }
+                break;
+            case 7:
+                printf("��J�n�������m: ");
+                scanf("%d", &index);
+                get(&list, index);
+                break;
+            case 8:
+                printAll(&list);
+                break;
+            default:
+                printf("�L�Ī����,�Э��s��J\n");
+        }
+    }
+
+    return 0;
+}
+
+// �Ыطs�`�I
+Node* createNode(int value) {
+    Node* newNode = (Node*)malloc(sizeof(Node));
+    if (newNode == NULL) {
+        printf("�O������t����\n");
+        exit(1);
+    }
+    newNode->value = value;
+    newNode->next = NULL;
+    return newNode;
+}
+
+// ��l���쵲��C
+void initLinkedList(LinkedList* list) {
+    list->head = NULL;
+    list->length = 0;
+    list->memoryUsed = 0;
+}
+
+// �q���s�W�`�I
+void push(LinkedList* list, int value) {
+    Node* newNode = createNode(value);
+    if (list->length == 0) {
+        list->head = newNode;
+    } else {
+        Node* currentNode = list->head;
+        while (currentNode->next != NULL) {
+            currentNode = currentNode->next;
+        }
+        currentNode->next = newNode;
+    }
+    list->length++;
+    list->memoryUsed += sizeof(Node);
+}
+
+// �q�������`�I
+Node* pop(LinkedList* list) {
+	
+    if (list->length == 0) {
+        return NULL;
+    } else if (list->length == 1) {
+        Node* temp = list->head;
+        list->head = NULL;
+        list->length = 0;
+        return temp;
+    } else {
+        Node* currentNode = list->head;
+        for (i = 1; i <= list->length - 2; i++) {
+            currentNode = currentNode->next;
+        }
+        Node* temp = currentNode->next;
+        currentNode->next = NULL;
+        list->length--;
+        return temp;
+    }
+}
+
+// �q�Y�s�W�`�I
+void unshift(LinkedList* list, int value) {
+    Node* newNode = createNode(value);
+    if (list->length == 0) {
+        list->head = newNode;
+    } else {
+        newNode->next = list->head;
+        list->head = newNode;
+    }
+    list->length++;
+    list->memoryUsed += sizeof(Node);
+}
+
+// �q�Y�����`�I
+Node* shift(LinkedList* list) {
+    if (list->length == 0) {
+        return NULL;
+    } else {
+        Node* temp = list->head;
+        list->head = list->head->next;
+        list->length--;
+        return temp;
+    }
+}
+
+// �q�����s�W�`�I
+void insert(LinkedList* list, int index, int value) {
+    if (index < 0 || index > list->length) {
+        return;
+    } else if (index == 0) {
+        unshift(list, value);
+    } else if (index == list->length) {
+        push(list, value);
+    } else {
+        Node* newNode = createNode(value);
+        Node* currentNode = list->head;
+        for ( i = 0; i < index - 1; i++) {
+            currentNode = currentNode->next;
+        }
+        newNode->next = currentNode->next;
+        currentNode->next = newNode;
+        list->length++;
+    }
+}
+
+// �q���������`�I
+Node* removeNode(LinkedList* list, int index) {
+    if (index < 0 || index >= list->length) {
+        return NULL;
+    } else if (index == 0) {
+        return shift(list);
+    } else if (index == list->length - 1) {
+        return pop(list);
+    } else {
+        Node* currentNode = list->head;
+        for ( i = 0; i < index - 1; i++) {
+            currentNode = currentNode->next;
+        }
+        Node* temp = currentNode->next;
+        currentNode->next = currentNode->next->next;
+        list->length--;
+        return temp;
+    }
+}
+
+// ���o�`�I��T
+void get(LinkedList* list, int index) {
+    if (index < 0 || index >= list->length) {
+        printf("���޶W�X�d��\n");
+    } else {
+        Node* currentNode = list->head;
+        for ( i = 0; i < index; i++) {
+            currentNode = currentNode->next;
+        }
+        printf("���� %d ����: %d\n", index, currentNode->value);
+    }
+}
+
+// ����쵲��C�����T
+void printAll(LinkedList* list) {
+	
+
+    if (list->length == 0) {
+        printf("�쵲��C����\n");
+    } else {
+        Node* currentNode = list->head;
+        while (currentNode != NULL) {
+            printf("%d ", currentNode->value);
+            currentNode = currentNode->next;
+        }
+        printf("\n");
+    }
+}
+
+// �s�W�G�������쵲��C
+void freeLinkedList(LinkedList* list) {
+    Node* current = list->head;
+    while (current != NULL) {
+        Node* temp = current;
+        current = current->next;
+        free(temp);
+    }
+    list->head = NULL;
+    list->length = 0;
+    list->memoryUsed = 0;
+    printf("�Ҧ��O����w����\n");
+}
diff --git a/作業/unit4/try.o b/作業/unit4/try.o
new file mode 100644
index 0000000..3bb25b7
Binary files /dev/null and b/作業/unit4/try.o differ
diff --git a/作業/unit4/老師解答/YunTechStudents.txt b/作業/unit4/老師解答/YunTechStudents.txt
new file mode 100644
index 0000000..d0c309a
--- /dev/null
+++ b/作業/unit4/老師解答/YunTechStudents.txt
@@ -0,0 +1,18 @@
+YunTech EE Department (2024)
+======================================
+Name		English	Math		
+---------------+-------+--------------
+Steve Jobs	50	60
+Tom Cruise	30	40
+Marie Jane	70	80
+Barrack Obama	46	77
+John Tyler	98	96
+U. S. Grant	97	88
+Robert Redford	22	33
+Bruce Lee	90	90
+**************************************
++ Oliver Hardy	90	80
++ Slim Pickens	88	82
+- Marie Jane	0	0
++ James Bond	88	82
+- Barrack Obama 0	0
\ No newline at end of file
diff --git a/作業/unit4/老師解答/YunTechStudents2.txt b/作業/unit4/老師解答/YunTechStudents2.txt
new file mode 100644
index 0000000..5be8c1e
--- /dev/null
+++ b/作業/unit4/老師解答/YunTechStudents2.txt
@@ -0,0 +1,20 @@
+YunTech EE Department (2024)
+======================================
+Name		English	Math		
+---------------+-------+--------------
+Steve Jobs	50	60
+Tom Cruise	30	40
+Marie Jane	70	80
+Barrack Obama	46	77
+John Tyler	98	96
+U. S. Grant	97	88
+Robert Redford	22	33
+Bruce Lee	90	90
+**************************************
+- Steve Jobs	0	0
++ Oliver Hardy	90	80
++ Slim Pickens	88	82
+- Marie Jane	0	0
++ James Bond	88	82
+- Barrack Obama 0	0
+- James Bond	0	0
\ No newline at end of file
diff --git a/作業/unit4/老師解答/file-records-adds-drops-v1.c b/作業/unit4/老師解答/file-records-adds-drops-v1.c
new file mode 100644
index 0000000..96b64f2
--- /dev/null
+++ b/作業/unit4/老師解答/file-records-adds-drops-v1.c
@@ -0,0 +1,285 @@
+/*
+Program: file-records-adds-drops-v1.c (Report comments/bugs to chikh@yuntech.edu.tw)
+Function: �u��Ƶ��c�P�t��k�v�ĥ|���@�~�Ѧҵ{���X�A�n�D���W�����ҵ{�����C 
+		  ���{���w�qstudent��ƫ��A�ΥH�ظm�@�����V��C�����h��ǥͪ����Z��ơA�èϥ�head�Ptail
+		  �����O���V��C��������
+Notes: 1) ���{����{���V��C�A�����F�٫o�ѼƶǨӶǥh�l�ͪ��Ӹ`�x�Z�A�ŧihead�Btail�Ptotal(�`�I
+		  �Ӽ�)�������ܼơA�H�D��n
+	   2) ��head�Ptail���������ܼơA���{������N�]showAll()�BsortName()�BsortEng()�BsortMath()
+	      ���禡�ǤJhead�޼ơA�H�Q�P�ǵo�Q�Ѽƶǻ����򥻧Φ�
+	   3) �Y��head�Ptail�ŧi��main()�����ϰ��ܼơA�P�Ǥ]�����D�p�����{�����T���� 
+	   4) ����sscanf()���Ϊk�A���˳���ۦѮv��z���@�g�޳N�u�� http://ccckmit.wikidot.com/cp:sscanf
+*/
+
+#include <stdio.h> 
+#include <stdlib.h> /* for malloc(), calloc() */ 
+#include <string.h>	/* for strcmp() */
+#include <conio.h> 	/* for getche() */
+
+typedef struct student student;
+struct student {
+	char    name[24]; 
+	int     eng, math;
+	student *prev;
+	student *next;
+} *head, *tail, dummy; 
+
+int total = 0;
+
+void traceBack(student *tail) /* �q�Y�ܧ���ܨC�@�Ӹ`�I�����e */
+{
+	student *ptr; /* ���V�C�@�`�I�ҥΪ����� */
+	
+	printf("\n�^����ܾǥͬ����p�U�G\n");
+	for (ptr = tail; ptr != NULL; ptr = ptr->prev) 
+		printf("%s\t%d\t%d\n",ptr->name,ptr->eng,ptr->math);
+}
+
+void showAll(student *head, student *tail) /* ��ܦ�C���C�@�Ӹ`�I�����e */
+{
+	student *ptr; /* ���V�C�@�`�I�ҥΪ����� */
+	
+	printf("�ǥ�\t\t�^��\t�ƾ�\n---------------+-------+-----\n");
+	for (ptr = head; ptr != NULL; ptr = ptr->next) 
+		printf("%s\t%d\t%d\n",ptr->name,ptr->eng,ptr->math);
+		
+	traceBack(tail);
+}
+
+/* �ǤJ�޼Ƭ��@���r��(Ĵ�pSteve Jobs 50 60)�A�q���Ѩ��m�W�B�^��B�ƾǬ즨�Z��
+   ��ƧΦ��s�`�I�A�ç�`�I�[�J��C������(�վ�tail) */
+void addRecord(char line[], int showEntireList) 
+{
+	char    name[24], str[24]; 
+    student *ptr = tail;
+    
+	//tail = tail->next = (student *)malloc(sizeof(student));	//�Ыطs�`�I�һݪŶ��A�æ���tail�ҫ����ǥͬ������᪺���� 
+	tail = tail->next = (student *)calloc(1,sizeof(student));
+	tail->prev = ptr;
+	
+	while (1) {
+		if (sscanf(line,"%[A-Za-z.] %[^\n]",str,line) == 0) {	/* Ū���j�p�g�r���Υy�I�զ����^��W�r�AŪ�Jstr�A�Ĥ@�Ӫťդ��᪺�Ҧ��r��]��line */ 
+			sscanf(line,"%d %d",&tail->eng,&tail->math);
+			break;
+		}
+		sprintf(tail->name,tail->name[0]=='\0'? "%s%s": "%s %s",tail->name,str);	/* Ū�쪺�^��W�[�Jtail���Щҫ��`�I��name��줧�� */ 
+	}
+	tail->next = NULL;	
+    total++;	/* �`�I�ӼƼW1 */
+    if (showEntireList) { //�q�Y��ܦ�C�Ҧ����
+    	printf("\n�W�[�@����ơG%s\t%d\t%d\n\n",tail->name,tail->eng,tail->math);
+		showAll(head,tail);
+	}
+}
+
+/* �ǤJ�޼Ƭ��@���r��(Ĵ�pSteve Jobs 50 60)�A�N�q�������m�W(�����^��B�ƾǬ즨�Z)�ǥH
+   ����C���O�_���W�r�۲Ū�(�ؼ�)�`�I�A�Y���A�N��Ӹ`�I���e��`�I��s�_�� */
+void deleteRecord(char line[])
+{
+	char    fullName[24] = {0}, str[24];
+    student *ptr;
+    int score;
+	
+	while (1) {
+		if (sscanf(line,"%[a-zA-Z.] %[^\n]",str,line) == 0) break;
+		sprintf(fullName,fullName[0]=='\0'? "%s%s" : "%s %s",fullName,str); //sprintf(fullName,fullName[0]=='\0'? "%s%s " : "%s %s ",fullName,str);
+	}
+		
+    for (ptr = head; ptr != NULL; ptr = ptr->next) 
+    	if (!strcmp(ptr->name,fullName)) break;  /* ���A�ߧY�����j�� */ 
+	
+	if (ptr != NULL) { 			/* ptr�����šA�N���o�{�ؼ� */ 
+		if (ptr->prev==NULL) {	/* �Y�N�Q�R�����`�I�O��C�Y�A�h�վ�head���ؼФU�@�`�I */
+			head = ptr->next;
+			head->prev = NULL;
+		}
+		else {
+			ptr->prev->next = ptr->next;	/* ��e�@�`�I�P�ؼФU�@�`�I��s�_��(¶�L�ؼи`�I) */ 
+			if (ptr != tail) 
+				ptr->next->prev = ptr->prev;	/* �U�@�`�I��prev�����V�e�@�`�I */
+			else
+				tail = ptr->prev;
+		}	
+		printf("\n�����@����ơG%s\t%d\t%d\n\n",ptr->name,ptr->eng,ptr->math);
+    	free(ptr);	/* �R���ؼи`�I�Ҧ��Ŷ� */
+    	total--;	/* �`�I�ӼƤ�1 */
+		showAll(head,tail);
+	}
+	else
+		printf("������������(%s)�b��ƪ������s�b\n",fullName);
+}
+
+/* �ǤJ�޼Ƭ���C�}�Y������}�P���ް}�CindexName[]���_�l��}�A���禡�N�H�m��(last name)�@���ƧǨ̾� */
+int sortName(student *head, student *indexName[]) /* �Ь�Ū�ĤG�椸���u�ƲߡGC�y���}�C�v���q��62-67�����e */
+{ 
+	int 	i, j;
+	char    lastName[20], nextLastName[20], firstName[20];
+	student *ptr, *temp;
+	
+	for (i = 0, ptr = head; ptr != NULL; i++, ptr = ptr->next) 
+		indexName[i] = ptr; /* indexName[i]�O�s��C��i�`�I����}�A�N�Ǧ��i��Ƨ� */
+	
+	for (i = 0; i < total-1; i++)	/* ��w�ƧǪk */
+    	for (j = 0; j < total-i-1; j++) {
+    		sscanf(indexName[j]->name,"%s %s %s",lastName,lastName,lastName);
+    		sscanf(indexName[j+1]->name,"%s %s %s",nextLastName,nextLastName,nextLastName);
+    		if (strcmp(lastName,nextLastName) > 0) { /* �Y��j�����m�� > ��j+1�����m��A�h�洫 */
+				temp = indexName[j];      
+				indexName[j] = indexName[j+1];
+				indexName[j+1] = temp;
+			}
+		}
+	
+	return 1;
+}
+
+/* �ǤJ�޼Ƭ���C�}�Y������}�P���ް}�CindexEng[]���_�l��}�A�N�H�^�妨�Z���C�@���ƧǨ̾ڡF 
+   ���禡�B�@��z�P�W��sortName()�ۦP */
+int sortEng(student *head, student *indexEng[]) 
+{ 
+	int 	i, j;
+	student *ptr, *temp;
+	
+	for (i = 0, ptr = head; ptr != NULL; ptr = ptr->next) 
+		indexEng[i++] = ptr; /* indexEng[i]�O�s��C��i�`�I����}�A�N�Ǧ��i��Ƨ� */
+	
+	for (i = 0; i < total-1; i++) /* ��w�ƧǪkagain */
+    	for (j = 0; j < total-i-1; j++)
+     		if (indexEng[j]->eng < indexEng[j+1]->eng) { /* �Y��j�����^�妨�Z < ��j+1�����^�妨�Z�A�h�洫 */
+				temp = indexEng[j];      
+				indexEng[j] = indexEng[j+1];
+				indexEng[j+1] = temp;
+			}
+	
+	return 1;
+}
+
+/* �ǤJ�޼Ƭ���C�}�Y������}�P���ް}�CindexMath[]���_�l��}�A���禡�N�H�ƾǦ��Z���C�@���ƧǨ̾ڡF
+   ���禡�B�@��z�P�W��sortEng()�ۦP */
+int sortMath(student *head, student *indexMath[]) 
+{ 
+	int 	i, j;
+	student *ptr, *temp;
+	
+	for (i = 0, ptr = head; ptr != NULL; i++, ptr = ptr->next) 
+		indexMath[i] = ptr; /* indexMath[i]�O�s��C��i�`�I����}�A�N�Ǧ��i��Ƨ� */
+	
+	for (i = 0; i < total-1; i++) /* ��w�ƧǪkagain */
+    	for (j = 0; j < total-i-1; j++)
+     		if (indexMath[j]->math < indexMath[j+1]->math) { /* �Y��j�����ƾǦ��Z < ��j+1�����ƾǦ��Z�A�h�洫 */
+				temp = indexMath[j];      
+				indexMath[j] = indexMath[j+1];
+				indexMath[j+1] = temp;
+			}
+	
+	return 1;
+}
+
+void queryUser(student *head, student *indexName[], student *indexEng[], student *indexMath[])
+{
+	int i, n;
+	int engSorted = 0, mathSorted = 0; /* ���O�����^���ƧǻP�ƾǬ�ƧǬO�_�w����L */
+	
+	while (1) {
+		printf("\n**************************************************************************************\n" \
+			   "* 1 �H�m���Ƨ�  2 �H�^��Ƨ�  3 �^���n�W����  4 �H�ƾDZƧ�  5 �ƾDz�n�W����  0 ���� *\n" \
+			   "**************************************************************************************\n" \
+			   "��ܱN������@���\\��H(0--5) ==> "); 
+		switch (getche()) { 
+			case '1':
+				printf("\n\n�H�m���Ƨǵ��G�p�U�G\n");
+    			sortName(head,indexName);
+    			for (i = 0; i < total; i++) 
+					printf("%s\t%d\t%d\n",indexName[i]->name,indexName[i]->eng,indexName[i]->math);
+				break;
+			case '2':
+				printf("\n\n�H�^�妨�Z�Ƨǵ��G�p�U�G\n");
+				engSorted = sortEng(head,indexEng);
+				for (i = 0; i < total; i++) 
+					printf("%s\t%d\t%d\n",indexEng[i]->name,indexEng[i]->eng,indexEng[i]->math);
+    			break;
+    		case '3':
+    			if (!engSorted) 
+    				printf("\n�|���H�^��즨�Z���C�@�ƧǡA�Х����\'2\'�\\��\n");
+				else {
+    				printf("\n�d�߭^���n�W����ơA��Jn (1-%d) ==> ",total);
+    				scanf("%d",&n);
+    				printf("�^���%d�����̡G%s\t%d\t%d\n",n,indexEng[n-1]->name,indexEng[n-1]->eng,indexEng[n-1]->math);
+				}					
+				break; 
+    		case '4':
+    			printf("\n\n�H�ƾǦ��Z�Ƨǵ��G�p�U�G\n");
+				mathSorted = sortMath(head,indexMath);
+				for (i = 0; i < total; i++) 
+					printf("%s\t%d\t%d\n",indexMath[i]->name,indexMath[i]->eng,indexMath[i]->math);
+				break;					
+			case '5':
+    			if (!mathSorted) 
+    				printf("\n�|���H�ƾǬ즨�Z���C�@�ƧǡA�Х����\'4\'�\\��\n");
+				else {
+    				printf("\n�d�߼ƾDz�n�W����ơA��Jn (1-%d) ==> ",total);
+    				scanf("%d",&n);
+    				printf("�ƾDz�%d�����̡G%s\t%d\t%d\n",n,indexMath[n-1]->name,indexMath[n-1]->eng,indexMath[n-1]->math);
+				}					
+				break; 
+			case '0':
+				return;
+			default:
+				printf("���Ī���ܬ�0--5�A�Э��s��J\n");
+				system("pause");
+		}
+	}
+}
+
+int main()
+{
+	int     i;
+	char    line[120], mode; /* mode�Ω�Ϥ��W���ƪ��u�@�Ҧ� */ 
+	   	
+   	tail = &dummy;	/* dummy���Ȯɥγ~���`�I�A�ɤJ���`�I�N�ϱotail��head��l�B�@�קK�X���A�P�ǥi�z�ѳo�˼g�P�A��������k����t�O? */
+    
+    FILE *inputFile;/* ��J�ɮצb�{���������N�� */
+	if ((inputFile=fopen("YunTechStudents.txt","r")) == NULL) {   /* �]�w�}�ɼҦ�����J�γ~�A�˵��ɮץi�_�}�ҡA�Yinput���šA�N���ɮפ��s�b */
+		printf("��J�ɤ��s�b\n");
+		exit(1);	/* �h�X�{�� */
+	}
+	
+	for (i = 0; i < 4; i++) fgets(line,120,inputFile);	/* ��J���ɶ}�Y���|�C��r���Ʊ� */
+	while (fgets(line,120,inputFile) != NULL) { 		/* ��IJ���ɮץ��ݡA�N���|����ƥiŪ���A���ưj�餺�ʧ@ */
+  		//Ū���@��C���e�A�s�Jline�r���ܼƤ��� 
+  		if (!strcmp(line,"**************************************\n")) break; /* �wŪ������j�u�A�N������t�@�B�z�Ҧ� */
+  		addRecord(line,0);	//Ū���쪺��C���e(Ĵ�pSteve Jobs 50 60)���addRecord()�Ѩ��J��C�Ffalse�N�����ݱq�Y��ܦ�C�Ҧ���� 
+  	}
+  	
+  	printf("�Ĥ@���q���Ū�������A�@��%d���O��\n\n",total);
+  	head = dummy.next; /* �w��head���Vdummy.next�ҫ��`�I */
+  	head->prev = NULL;
+	showAll(head,tail);
+	
+	printf("\n�H�W����J�ɮ�\"���j�u\"�H�W����ơA�����N��}�l�W���� ...\n"); //system("pause");
+	getche();
+   	
+   	while (fgets(line,120,inputFile) != NULL) { 
+		sscanf(line,"%c %[^\n]s",&mode,line);	 /* Ū��'+'��'-'�]�Jmode�ܼƤ��A�ɩw���P���B�z�Ҧ� */
+  		if (mode == '+') 		/* �W�[���� */
+		  	addRecord(line,1);	/* ��Cline�ܼƥ��addRecord()�Ѩ��һݸ�ơA�ñq�Y��ܦ�C�Ҧ���� */
+		else if (mode == '-') 	/* �R����� */
+			deleteRecord(line);	/* line�ҧt�m�W�N��deleteRecord()���A�Y�s�b���C�A�N�����ӵ������ñq�Y��ܦ�C�Ҧ���� */
+		else 
+			printf("�������O�Asorry :(\n");
+  	}
+  	fclose(inputFile);
+  	
+  	student *indexName[100], *indexEng[100], *indexMath[100]; /* ��쪺���ް}�C�A�w�]�i�O100�Ӹ`�I��} */
+  	/* �Y���Q�ϥΦp�W�T�w���ת��}�C�A�i���total�ƭȤ��t���������Ӽƪ��}�C�A���Яd�N���U�g�k */
+  	/*
+	student **indexName = (student **)malloc(total*sizeof(student *)), 
+	  	    **indexEng = (student **)malloc(total*sizeof(student *)), 
+			**indexMath = (student **)malloc(total*sizeof(student *)); 
+	*/
+
+    queryUser(head,indexName,indexEng,indexMath);	/* ���ͥ\����A�è̿ﶵ����������\�� */ 
+	printf("�{�������ABye��\n");
+	
+	return 0;
+}
diff --git a/作業/unit4/老師解答/file-records-adds-drops-v1.exe b/作業/unit4/老師解答/file-records-adds-drops-v1.exe
new file mode 100644
index 0000000..5083620
Binary files /dev/null and b/作業/unit4/老師解答/file-records-adds-drops-v1.exe differ
diff --git a/作業/unit4/老師解答/file-records-adds-drops-v2.c b/作業/unit4/老師解答/file-records-adds-drops-v2.c
new file mode 100644
index 0000000..a0549d7
--- /dev/null
+++ b/作業/unit4/老師解答/file-records-adds-drops-v2.c
@@ -0,0 +1,290 @@
+/*
+Program: file-records-adds-drops-v2.c (Report comments/bugs to chikh@yuntech.edu.tw)
+Function: ��}file-records-adds-drops-v1.c�A�ϱo�ƧǤ覡�i�H�зǨ�Ʈw��qsort()��@
+Notes: 1) ���{����{���V��C�A�����F�٫o�ѼƶǨӶǥh�l�ͪ��Ӹ`�x�Z�A�ŧihead�Btail�Ptotal(�`�I
+		  �Ӽ�)�������ܼơA�H�D��n
+	   2) ��head�Ptail���������ܼơA���{������N�]showAll()�BsortName()�BsortEng()�BsortMath()
+	      ���禡�ǤJhead�޼ơA�H�Q�P�ǵo�Q�Ѽƶǻ����򥻧Φ�
+	   3) �Y��head�Ptail�ŧi��main()�����ϰ��ܼơA�P�Ǥ]�����D�p�����{�����T���� 
+	   4) ����sscanf()���Ϊk�A���˳���ۦѮv��z���@�g�޳N�u�� http://ccckmit.wikidot.com/cp:sscanf
+*/
+
+#include <stdio.h>	
+#include <stdlib.h> /* for malloc(), calloc(), qsort() */ 
+#include <string.h>	/* for strcmp() */
+#include <conio.h> 	/* for getche() */
+
+typedef struct student student;
+struct student {
+	char    name[24]; 
+	int     eng, math;
+	student *prev;
+	student *next;
+} *head, *tail, dummy; 
+
+int total = 0;
+
+void traceBack(student *tail) /* �q�Y�ܧ���ܨC�@�Ӹ`�I�����e */
+{
+	student *ptr; /* ���V�C�@�`�I�ҥΪ����� */
+	
+	printf("\n�^����ܾǥͬ����p�U�G\n");
+	for (ptr = tail; ptr != NULL; ptr = ptr->prev) 
+		printf("%s\t%d\t%d\n",ptr->name,ptr->eng,ptr->math);
+}
+
+void showAll(student *head, student *tail) /* ��ܦ�C���C�@�Ӹ`�I�����e */
+{
+	student *ptr; /* ���V�C�@�`�I�ҥΪ����� */
+	
+	printf("�ǥ�\t\t�^��\t�ƾ�\n---------------+-------+-----\n");
+	for (ptr = head; ptr != NULL; ptr = ptr->next) 
+		printf("%s\t%d\t%d\n",ptr->name,ptr->eng,ptr->math);
+		
+	traceBack(tail);
+}
+
+/* �ǤJ�޼Ƭ��@���r��(Ĵ�pSteve Jobs 50 60)�A�q���Ѩ��m�W�B�^��B�ƾǬ즨�Z��
+   ��ƧΦ��s�`�I�A�ç�`�I�[�J��C������(�վ�tail) */
+void addRecord(char line[], int showEntireList) 
+{
+	char    name[24], str[24]; 
+    student *ptr = tail;
+    
+	//tail = tail->next = (student *)malloc(sizeof(student));	//�Ыطs�`�I�һݪŶ��A�æ���tail�ҫ����ǥͬ������᪺���� 
+	tail = tail->next = (student *)calloc(1,sizeof(student));
+	tail->prev = ptr;
+	
+	while (1) {
+		if (sscanf(line,"%[A-Za-z.] %[^\n]",str,line) == 0) {	/* Ū���j�p�g�r���Υy�I�զ����^��W�r�AŪ�Jstr�A�Ĥ@�Ӫťդ��᪺�Ҧ��r��]��line */ 
+			sscanf(line,"%d %d",&tail->eng,&tail->math);
+			break;
+		}
+		sprintf(tail->name,tail->name[0]=='\0'? "%s%s": "%s %s",tail->name,str);	/* Ū�쪺�^��W�[�Jtail���Щҫ��`�I��name��줧�� */ 
+	}
+	tail->next = NULL;	
+    total++;	/* �`�I�ӼƼW1 */
+    if (showEntireList) { //�q�Y��ܦ�C�Ҧ����
+    	printf("\n�W�[�@����ơG%s\t%d\t%d\n\n",tail->name,tail->eng,tail->math);
+		showAll(head,tail);
+	}
+}
+
+/* �ǤJ�޼Ƭ��@���r��(Ĵ�pSteve Jobs 50 60)�A�N�q�������m�W(�����^��B�ƾǬ즨�Z)�ǥH
+   ����C���O�_���W�r�۲Ū�(�ؼ�)�`�I�A�Y���A�N��Ӹ`�I���e��`�I��s�_�� */
+void deleteRecord(char line[])
+{
+	char    fullName[24] = {0}, str[24];
+    student *ptr;
+    int score;
+	
+	while (1) {
+		if (sscanf(line,"%[a-zA-Z.] %[^\n]",str,line) == 0) break;
+		sprintf(fullName,fullName[0]=='\0'? "%s%s" : "%s %s",fullName,str); //sprintf(fullName,fullName[0]=='\0'? "%s%s " : "%s %s ",fullName,str);
+	}
+		
+    for (ptr = head; ptr != NULL; ptr = ptr->next) 
+    	if (!strcmp(ptr->name,fullName)) break;  /* ���A�ߧY�����j�� */ 
+	
+	if (ptr != NULL) { 			/* ptr�����šA�N���o�{�ؼ� */ 
+		if (ptr->prev==NULL) {	/* �Y�N�Q�R�����`�I�O��C�Y�A�h�վ�head���ؼФU�@�`�I */
+			head = ptr->next;
+			head->prev = NULL;
+		}
+		else {
+			ptr->prev->next = ptr->next;	/* ��e�@�`�I�P�ؼФU�@�`�I��s�_��(¶�L�ؼи`�I) */ 
+			if (ptr != tail) 
+				ptr->next->prev = ptr->prev;	/* �U�@�`�I��prev�����V�e�@�`�I */
+			else
+				tail = ptr->prev;
+		}	
+		printf("\n�����@����ơG%s\t%d\t%d\n\n",ptr->name,ptr->eng,ptr->math);
+    	free(ptr);	/* �R���ؼи`�I�Ҧ��Ŷ� */
+    	total--;	/* �`�I�ӼƤ�1 */
+		showAll(head,tail);
+	}
+	else
+		printf("������������(%s)�b��ƪ������s�b\n",fullName);
+}
+
+int nameAscend(const void *a, const void *b) /* ���W�Ҧ� */ 
+{
+	student **x = (student **)a;
+	student **y = (student **)b;
+	
+	char lastName[16], nextLastName[16];
+	
+	sscanf((**x).name,"%s %s %s",lastName,lastName,lastName);
+    sscanf((**y).name,"%s %s %s",nextLastName,nextLastName,nextLastName);
+	
+	return strcmp(lastName,nextLastName); //return strcmp((**x).name,(**y).name);
+}
+
+int engDescend(const void *a, const void *b) /* ����Ҧ� */ 
+{
+	student **x = (student **)a;
+	student **y = (student **)b;
+	
+	return (**y).eng - (**x).eng;
+}
+
+int mathDescend(const void *a, const void *b) /* ����Ҧ� */ 
+{
+	student **x = (student **)a;
+	student **y = (student **)b;
+	
+	return (**y).math - (**x).math;
+}
+
+int sortName(student *head, student *indexName[]) /* �Ь�Ū�ĤG�椸���u�ƲߡGC�y���}�C�v���q��62-67�����e */
+{ 
+	int 	i, j;
+	char    lastName[20], nextLastName[20], firstName[20];
+	student *ptr, *temp;
+	
+	for (i = 0, ptr = head; ptr != NULL; i++, ptr = ptr->next) 
+		indexName[i] = ptr; /* indexName[i]�O�s��C��i�`�I����}�A�N�Ǧ��i��Ƨ� */
+	
+	qsort(indexName,total,sizeof(indexName[0]),nameAscend);
+	
+	return 1;
+}
+
+/* �ǤJ�޼Ƭ���C�}�Y������}�P���ް}�CindexEng[]���_�l��}�A�N�H�^�妨�Z���C�@���ƧǨ̾ڡF 
+   ���禡�B�@��z�P�W��sortName()�ۦP */
+int sortEng(student *head, student *indexEng[]) 
+{ 
+	int 	i, j;
+	student *ptr, *temp;
+	
+	for (i = 0, ptr = head; ptr != NULL; ptr = ptr->next) 
+		indexEng[i++] = ptr; /* indexEng[i]�O�s��C��i�`�I����}�A�N�Ǧ��i��Ƨ� */
+	
+	qsort(indexEng,total,sizeof(indexEng[0]),engDescend);
+	
+	return 1;
+}
+
+/* �ǤJ�޼Ƭ���C�}�Y������}�P���ް}�CindexMath[]���_�l��}�A���禡�N�H�ƾǦ��Z���C�@���ƧǨ̾ڡF
+   ���禡�B�@��z�P�W��sortEng()�ۦP */
+int sortMath(student *head, student *indexMath[]) 
+{ 
+	int 	i, j;
+	student *ptr, *temp;
+	
+	for (i = 0, ptr = head; ptr != NULL; i++, ptr = ptr->next) 
+		indexMath[i] = ptr; /* indexMath[i]�O�s��C��i�`�I����}�A�N�Ǧ��i��Ƨ� */
+	
+	qsort(indexMath,total,sizeof(indexMath[0]),mathDescend);
+	
+	return 1;
+}
+
+void queryUser(student *head, student *indexName[], student *indexEng[], student *indexMath[])
+{
+	int i, n;
+	int engSorted = 0, mathSorted = 0; /* ���O�����^���ƧǻP�ƾǬ�ƧǬO�_�w����L */
+	
+	while (1) {
+		printf("\n**************************************************************************************\n" \
+			   "* 1 �H�m���Ƨ�  2 �H�^��Ƨ�  3 �^���n�W����  4 �H�ƾDZƧ�  5 �ƾDz�n�W����  0 ���� *\n" \
+			   "**************************************************************************************\n" \
+			   "��ܱN������@���\\��H(0--5) ==> "); 
+		switch (getche()) { 
+			case '1':
+				printf("\n\n�H�m���Ƨǵ��G�p�U�G\n");
+    			sortName(head,indexName);
+    			for (i = 0; i < total; i++) 
+					printf("%s\t%d\t%d\n",indexName[i]->name,indexName[i]->eng,indexName[i]->math);
+				break;
+			case '2':
+				printf("\n\n�H�^�妨�Z�Ƨǵ��G�p�U�G\n");
+				engSorted = sortEng(head,indexEng);
+				for (i = 0; i < total; i++) 
+					printf("%s\t%d\t%d\n",indexEng[i]->name,indexEng[i]->eng,indexEng[i]->math);
+    			break;
+    		case '3':
+    			if (!engSorted) 
+    				printf("\n�|���H�^��즨�Z���C�@�ƧǡA�Х����\'2\'�\\��\n");
+				else {
+    				printf("\n�d�߭^���n�W����ơA��Jn (1-%d) ==> ",total);
+    				scanf("%d",&n);
+    				printf("�^���%d�����̡G%s\t%d\t%d\n",n,indexEng[n-1]->name,indexEng[n-1]->eng,indexEng[n-1]->math);
+				}					
+				break; 
+    		case '4':
+    			printf("\n\n�H�ƾǦ��Z�Ƨǵ��G�p�U�G\n");
+				mathSorted = sortMath(head,indexMath);
+				for (i = 0; i < total; i++) 
+					printf("%s\t%d\t%d\n",indexMath[i]->name,indexMath[i]->eng,indexMath[i]->math);
+				break;					
+			case '5':
+    			if (!mathSorted) 
+    				printf("\n�|���H�ƾǬ즨�Z���C�@�ƧǡA�Х����\'4\'�\\��\n");
+				else {
+    				printf("\n�d�߼ƾDz�n�W����ơA��Jn (1-%d) ==> ",total);
+    				scanf("%d",&n);
+    				printf("�ƾDz�%d�����̡G%s\t%d\t%d\n",n,indexMath[n-1]->name,indexMath[n-1]->eng,indexMath[n-1]->math);
+				}					
+				break; 
+			case '0':
+				return;
+			default:
+				printf("���Ī���ܬ�0--5�A�Э��s��J\n");
+				system("pause");
+		}
+	}
+}
+
+int main()
+{
+	int     i;
+	char    line[120], mode; /* mode�Ω�Ϥ��W���ƪ��u�@�Ҧ� */ 
+	   	
+   	tail = &dummy;	/* dummy���Ȯɥγ~���`�I�A�ɤJ���`�I�N�ϱotail��head��l�B�@�קK�X���A�P�ǥi�z�ѳo�˼g�P�A��������k����t�O? */
+    
+    FILE *inputFile;/* ��J�ɮצb�{���������N�� */
+	if ((inputFile=fopen("YunTechStudents.txt","r")) == NULL) {   /* �]�w�}�ɼҦ�����J�γ~�A�˵��ɮץi�_�}�ҡA�Yinput���šA�N���ɮפ��s�b */
+		printf("��J�ɤ��s�b\n");
+		exit(1);	/* �h�X�{�� */
+	}
+	
+	for (i = 0; i < 4; i++) fgets(line,120,inputFile);	/* ��J���ɶ}�Y���|�C��r���Ʊ� */
+	while (fgets(line,120,inputFile) != NULL) { 		/* ��IJ���ɮץ��ݡA�N���|����ƥiŪ���A���ưj�餺�ʧ@ */
+  		//Ū���@��C���e�A�s�Jline�r���ܼƤ��� 
+  		if (!strcmp(line,"**************************************\n")) break; /* �wŪ������j�u�A�N������t�@�B�z�Ҧ� */
+  		addRecord(line,0);	//Ū���쪺��C���e(Ĵ�pSteve Jobs 50 60)���addRecord()�Ѩ��J��C�Ffalse�N�����ݱq�Y��ܦ�C�Ҧ���� 
+  	}
+  	
+  	printf("�Ĥ@���q���Ū�������A�@��%d���O��\n\n",total);
+  	head = dummy.next; /* �w��head���Vdummy.next�ҫ��`�I */
+  	head->prev = NULL;
+	showAll(head,tail);
+	
+	printf("\n�H�W����J�ɮ�\"���j�u\"�H�W����ơA�����N��}�l�W���� ...\n"); //system("pause");
+	getche();
+   	
+   	while (fgets(line,120,inputFile) != NULL) { 
+		sscanf(line,"%c %[^\n]s",&mode,line);	 /* Ū��'+'��'-'�]�Jmode�ܼƤ��A�ɩw���P���B�z�Ҧ� */
+  		if (mode == '+') 		/* �W�[���� */
+		  	addRecord(line,1);	/* ��Cline�ܼƥ��addRecord()�Ѩ��һݸ�ơA�ñq�Y��ܦ�C�Ҧ���� */
+		else if (mode == '-') 	/* �R����� */
+			deleteRecord(line);	/* line�ҧt�m�W�N��deleteRecord()���A�Y�s�b���C�A�N�����ӵ������ñq�Y��ܦ�C�Ҧ���� */
+		else 
+			printf("�������O�Asorry :(\n");
+  	}
+  	fclose(inputFile);
+  	
+  	student *indexName[100], *indexEng[100], *indexMath[100]; /* ��쪺���ް}�C�A�w�]�i�O100�Ӹ`�I��} */
+  	/* �Y���Q�ϥΦp�W�T�w���ת��}�C�A�i���total�ƭȤ��t���������Ӽƪ��}�C�A���Яd�N���U�g�k */
+  	/*
+	student **indexName = (student **)malloc(total*sizeof(student *)), 
+	  	    **indexEng = (student **)malloc(total*sizeof(student *)), 
+			**indexMath = (student **)malloc(total*sizeof(student *)); 
+	*/
+
+    queryUser(head,indexName,indexEng,indexMath);	/* ���ͥ\����A�è̿ﶵ����������\�� */ 
+	printf("�{�������ABye��\n");
+	
+	return 0;
+}
diff --git a/作業/unit4/老師解答/file-records-adds-drops.zip b/作業/unit4/老師解答/file-records-adds-drops.zip
new file mode 100644
index 0000000..4371850
Binary files /dev/null and b/作業/unit4/老師解答/file-records-adds-drops.zip differ
diff --git a/作業/unit4/老師解答/sscanf.c b/作業/unit4/老師解答/sscanf.c
new file mode 100644
index 0000000..1970e62
--- /dev/null
+++ b/作業/unit4/老師解答/sscanf.c
@@ -0,0 +1,86 @@
+/*
+Program: sscanf.c
+Function: �i��sscanf()�Pqsort()���Ϊk
+Note: �s�צ۳���۱бª����� http://ccckmit.wikidot.com/cp:sscanf 
+*/
+
+#include <stdio.h>
+
+int ascend(const void *a, const void *b); //�t�Xqsort()�ҥΨ�ơA�Ω����ǤJ�G�������j�p���Y�A�Ω��{���W�λ���ĪG 
+
+int main() {
+	char name[20], tel[50], field[20], areaCode[20], code[20];
+	int age;
+	
+	sscanf("name:john age:40 tel:082-313530", "%s", name);
+	printf("%s\n", name);
+	sscanf("name:john age:40 tel:082-313530", "%8s", name);
+	printf("%s\n", name);
+	sscanf("name:john age:40 tel:082-313530", "%[^:]", name);
+	printf("%s\n", name);
+	sscanf("name:john age:40 tel:082-313530", "%[^:]:%s", field, name);
+	printf("%s %s\n", field, name);
+	sscanf("name:john age:40 tel:082-313530", "name:%s age:%d tel:%s", name, &age, tel);
+	printf("%s %d %s\n", name, age, tel);
+	sscanf("name:john age:40 tel:082-313530", "%*[^:]:%s %*[^:]:%d %*[^:]:%s", name, &age, tel);
+	printf("%s %d %s\n", name, age, tel);
+  
+	char protocol[10], site[50], path[50];
+  	sscanf("http://ccckmit.wikidot.com/cp/list/hello.txt", 
+         "%[^:]:%*2[/]%[^/]/%[a-zA-Z0-9._/-]", 
+         protocol, site, path);
+  	printf("protocol=%s site=%s path=%s\n", protocol, site, path);
+  	
+  	/*-----------------------------------------------------------------------*/
+  	
+  	char str[30];
+//	char line[] = "Steve Jobs 50 60"; 
+	char line[] = "U. S. Grant 97 88";
+  	int s1, s2;
+  	
+  	for (;;) {
+  		if (sscanf(line,"%[A-Za-z.] %[^\n]",str,line)==0) {
+  			sscanf(line,"%d %d",&s1,&s2);
+  			printf("\n�̥��G�Ʀr�Gs1 = %d; s2 = %d\n",s1,s2);
+  			break;
+		}
+		printf("\nŪ���X�ŰO�G%-10s�Ѿl���e�G%s",str,line);
+  	}	
+  	
+  	
+  	char fullName[] = "U. S. Grant", tmp[3][24];
+  	
+  	s1 = sscanf(fullName,"%s %s %s",tmp[0],tmp[1],tmp[2]);
+  	printf("\n�Ĥ@�ؤ�k��X�m��G%s",tmp[s1-1]);
+  	
+  	s1 = sscanf(fullName,"%s %s %s",str,str,str);
+  	printf("\n�ĤG�ؤ�k��X�m��G%s",str);
+  	
+  	for (;;) {
+  		if (sscanf(fullName,"%s %[^\n]",str,fullName) < 2) {
+  			printf("\n�ĤT�ؤ�k��X�m��G%s",fullName);
+  			break;
+		}
+  	}
+  	
+  	/*-----------------------------------------------------------------------*/
+  	
+  	char bigName[][12] = {"Jobs", "Cruise", "Jane", "Obama", "Tyler", "Grant", "Redford", "Lee"};
+  	int i, count = sizeof(bigName)/sizeof(bigName[0]), 
+	    size = sizeof(bigName[0]);
+
+	qsort(bigName,count,size,ascend);  
+	
+	printf("\n\n�Ƨǫᵲ�G�p�U:\n");
+	for (i = 0; i < count; i++)
+		printf("%s\n",bigName[i]);
+    
+	return 0;
+}
+
+int ascend(const void *a, const void *b) /* ���W�Ҧ� */ 
+{
+	char *x = (char *)a;
+	char *y = (char *)b;
+	return strcmp(x,y);
+}
diff --git a/作業/unit4/老師解答/sscanf.exe b/作業/unit4/老師解答/sscanf.exe
new file mode 100644
index 0000000..aa022a3
Binary files /dev/null and b/作業/unit4/老師解答/sscanf.exe differ
diff --git a/作業/unit5/.vscode/c_cpp_properties.json b/作業/unit5/.vscode/c_cpp_properties.json
new file mode 100644
index 0000000..cea4d3f
--- /dev/null
+++ b/作業/unit5/.vscode/c_cpp_properties.json
@@ -0,0 +1,18 @@
+{
+  "configurations": [
+    {
+      "name": "windows-gcc-x64",
+      "includePath": [
+        "${workspaceFolder}/**"
+      ],
+      "compilerPath": "gcc",
+      "cStandard": "${default}",
+      "cppStandard": "${default}",
+      "intelliSenseMode": "windows-gcc-x64",
+      "compilerArgs": [
+        ""
+      ]
+    }
+  ],
+  "version": 4
+}
\ No newline at end of file
diff --git a/作業/unit5/.vscode/launch.json b/作業/unit5/.vscode/launch.json
new file mode 100644
index 0000000..af6ca4c
--- /dev/null
+++ b/作業/unit5/.vscode/launch.json
@@ -0,0 +1,24 @@
+{
+  "version": "0.2.0",
+  "configurations": [
+    {
+      "name": "C/C++ Runner: Debug Session",
+      "type": "cppdbg",
+      "request": "launch",
+      "args": [],
+      "stopAtEntry": false,
+      "externalConsole": true,
+      "cwd": "e:/code/C++/unit5",
+      "program": "e:/code/C++/unit5/build/Debug/outDebug",
+      "MIMode": "gdb",
+      "miDebuggerPath": "gdb",
+      "setupCommands": [
+        {
+          "description": "Enable pretty-printing for gdb",
+          "text": "-enable-pretty-printing",
+          "ignoreFailures": true
+        }
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/作業/unit5/.vscode/settings.json b/作業/unit5/.vscode/settings.json
new file mode 100644
index 0000000..bb879da
--- /dev/null
+++ b/作業/unit5/.vscode/settings.json
@@ -0,0 +1,59 @@
+{
+  "C_Cpp_Runner.cCompilerPath": "gcc",
+  "C_Cpp_Runner.cppCompilerPath": "g++",
+  "C_Cpp_Runner.debuggerPath": "gdb",
+  "C_Cpp_Runner.cStandard": "",
+  "C_Cpp_Runner.cppStandard": "",
+  "C_Cpp_Runner.msvcBatchPath": "C:/Program Files/Microsoft Visual Studio/VR_NR/Community/VC/Auxiliary/Build/vcvarsall.bat",
+  "C_Cpp_Runner.useMsvc": false,
+  "C_Cpp_Runner.warnings": [
+    "-Wall",
+    "-Wextra",
+    "-Wpedantic",
+    "-Wshadow",
+    "-Wformat=2",
+    "-Wcast-align",
+    "-Wconversion",
+    "-Wsign-conversion",
+    "-Wnull-dereference"
+  ],
+  "C_Cpp_Runner.msvcWarnings": [
+    "/W4",
+    "/permissive-",
+    "/w14242",
+    "/w14287",
+    "/w14296",
+    "/w14311",
+    "/w14826",
+    "/w44062",
+    "/w44242",
+    "/w14905",
+    "/w14906",
+    "/w14263",
+    "/w44265",
+    "/w14928"
+  ],
+  "C_Cpp_Runner.enableWarnings": true,
+  "C_Cpp_Runner.warningsAsError": false,
+  "C_Cpp_Runner.compilerArgs": [],
+  "C_Cpp_Runner.linkerArgs": [],
+  "C_Cpp_Runner.includePaths": [],
+  "C_Cpp_Runner.includeSearch": [
+    "*",
+    "**/*"
+  ],
+  "C_Cpp_Runner.excludeSearch": [
+    "**/build",
+    "**/build/**",
+    "**/.*",
+    "**/.*/**",
+    "**/.vscode",
+    "**/.vscode/**"
+  ],
+  "C_Cpp_Runner.useAddressSanitizer": false,
+  "C_Cpp_Runner.useUndefinedSanitizer": false,
+  "C_Cpp_Runner.useLeakSanitizer": false,
+  "C_Cpp_Runner.showCompilationTime": false,
+  "C_Cpp_Runner.useLinkTimeOptimization": false,
+  "C_Cpp_Runner.msvcSecureNoWarnings": false
+}
\ No newline at end of file
diff --git a/作業/unit5/DS5.cpp b/作業/unit5/DS5.cpp
new file mode 100644
index 0000000..49ada7a
--- /dev/null
+++ b/作業/unit5/DS5.cpp
@@ -0,0 +1,54 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+int count_num = 0 , count = 1 , temp ;
+
+int calculate(int i ,int count_num, int num ){
+	int a = 0;
+	if(num>=i) {
+		num -= i;
+		count_num++;
+	}else if(num!=0){
+		count_num++;
+		printf("\n�̤p�]�\\�˯ȭ��n = %d\n",(count_num+i+temp)*2*100);
+		printf("\n�]�ˤ覡���\\��Y�z�ơG\n\n");
+		printf("��%d�ơA�\\%d��\n",count,i);
+		count++;
+		a = num;
+		return a;
+	}else{
+		printf("\n�̤p�]�\\�˯ȭ��n = %d\n",(count_num+i+temp)*2*100);
+		printf("\n�]�ˤ覡����Y�z��\n\n");
+		a = num;
+		return a;
+	}
+	
+	a = calculate(i,count_num,num);
+	
+	if(num != temp - i || temp%i==0){
+		printf("��%d�ơA�\\%d��\n",count,i);
+	}else {
+		printf("��%d�ơA�\\%d��\n",count,a);
+	}
+
+	count++;
+	return a;
+}
+
+int main(){
+	int num ,i=0;
+	printf("*** �̤p�]�˭��n���l�H�]�L�{�� ***\n\n��J�}�j�� ==> ");
+	scanf("%d",&num);
+	if(num<=0){
+		printf("\n��J���~");
+		return 0;
+	}
+	
+	i = sqrt(num);
+	temp = num ;
+	
+	calculate(i,count_num,num);
+	
+	return 0;
+}
diff --git a/作業/unit5/DS5.exe b/作業/unit5/DS5.exe
new file mode 100644
index 0000000..78b2978
Binary files /dev/null and b/作業/unit5/DS5.exe differ
diff --git a/作業/unit5/DS5_not_Recursion.cpp b/作業/unit5/DS5_not_Recursion.cpp
new file mode 100644
index 0000000..a377b9c
--- /dev/null
+++ b/作業/unit5/DS5_not_Recursion.cpp
@@ -0,0 +1,37 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+int main(){
+	int num ,i=0 , j=1 ,temp;
+	printf("*** �̤p�]�˭��n���l�H�]�L�{�� ***\n\n��J�}�j�� ==> ");
+	scanf("%d",&num);
+	temp = num ;
+	while(1){
+		if(pow(i,2)<=temp) i++;
+		else break; 
+	}
+	i--;
+
+	printf("\n�]�ˤ覡����Y�z��\n\n");
+	
+	while(1){
+		if(temp>=i){
+			printf("��%d�ơA%d��\n",j,i);
+			temp -= i;
+			j++;
+		}else if(temp!=0){
+			printf("��%d�ơA%d��\n",j,temp);
+			j++;
+			break;
+		}else{
+			break;
+		}
+	}
+	j--;
+	
+	printf("\n�̤p�]�˯ȭ��n = %d\n",(j+i+num)*2*100);
+	
+	
+	return 0;
+}
diff --git a/作業/unit5/DS5_not_Recursion.exe b/作業/unit5/DS5_not_Recursion.exe
new file mode 100644
index 0000000..4e65eed
Binary files /dev/null and b/作業/unit5/DS5_not_Recursion.exe differ
diff --git a/作業/unit5/Makefile.win b/作業/unit5/Makefile.win
new file mode 100644
index 0000000..44d8be4
--- /dev/null
+++ b/作業/unit5/Makefile.win
@@ -0,0 +1,28 @@
+# Project: Project1
+# Makefile created by Dev-C++ 5.11
+
+CPP      = g++.exe
+CC       = gcc.exe
+WINDRES  = windres.exe
+OBJ      = gcd.o
+LINKOBJ  = gcd.o
+LIBS     = -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib" -L"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/lib" -static-libgcc
+INCS     = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include"
+CXXINCS  = -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/x86_64-w64-mingw32/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include" -I"C:/Program Files (x86)/Dev-Cpp/MinGW64/lib/gcc/x86_64-w64-mingw32/4.9.2/include/c++"
+BIN      = Project1.exe
+CXXFLAGS = $(CXXINCS) 
+CFLAGS   = $(INCS) 
+RM       = rm.exe -f
+
+.PHONY: all all-before all-after clean clean-custom
+
+all: all-before $(BIN) all-after
+
+clean: clean-custom
+	${RM} $(OBJ) $(BIN)
+
+$(BIN): $(OBJ)
+	$(CPP) $(LINKOBJ) -o $(BIN) $(LIBS)
+
+gcd.o: gcd.cpp
+	$(CPP) -c gcd.cpp -o gcd.o $(CXXFLAGS)
diff --git a/作業/unit5/Project1.dev b/作業/unit5/Project1.dev
new file mode 100644
index 0000000..b65d61b
--- /dev/null
+++ b/作業/unit5/Project1.dev
@@ -0,0 +1,62 @@
+[Project]
+FileName=Project1.dev
+Name=Project1
+Type=1
+Ver=2
+ObjFiles=
+Includes=
+Libs=
+PrivateResource=
+ResourceIncludes=
+MakeIncludes=
+Compiler=
+CppCompiler=
+Linker=
+IsCpp=1
+Icon=
+ExeOutput=
+ObjectOutput=
+LogOutput=
+LogOutputEnabled=0
+OverrideOutput=0
+OverrideOutputName=
+HostApplication=
+UseCustomMakefile=0
+CustomMakefile=
+CommandLine=
+Folders=
+IncludeVersionInfo=0
+SupportXPThemes=0
+CompilerSet=0
+CompilerSettings=0000000000000000000000000
+UnitCount=1
+
+[VersionInfo]
+Major=1
+Minor=0
+Release=0
+Build=0
+LanguageID=1033
+CharsetID=1252
+CompanyName=
+FileVersion=
+FileDescription=Developed using the Dev-C++ IDE
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=
+AutoIncBuildNr=0
+SyncProduct=1
+
+[Unit1]
+FileName=gcd.cpp
+CompileCpp=1
+Folder=
+Compile=1
+Link=1
+Priority=1000
+OverrideBuildCmd=0
+BuildCmd=
+
diff --git a/作業/unit5/Project1.exe b/作業/unit5/Project1.exe
new file mode 100644
index 0000000..b673bc6
Binary files /dev/null and b/作業/unit5/Project1.exe differ
diff --git a/作業/unit5/Project1.layout b/作業/unit5/Project1.layout
new file mode 100644
index 0000000..c440945
--- /dev/null
+++ b/作業/unit5/Project1.layout
@@ -0,0 +1,13 @@
+[Editor_0]
+CursorCol=12
+CursorRow=30
+TopLine=1
+LeftChar=1
+[Editor_1]
+CursorCol=1
+CursorRow=1
+TopLine=9
+LeftChar=1
+[Editors]
+Order=0
+Focused=0
diff --git a/作業/unit5/dir-all.c b/作業/unit5/dir-all.c
new file mode 100644
index 0000000..173665c
--- /dev/null
+++ b/作業/unit5/dir-all.c
@@ -0,0 +1,63 @@
+/*
+Program: dir-all.c (Report comments/bugs to chikh@yuntech.edu.tw)
+Function: ��ܫ��w�ؿ����Ҧ��ɮפ���T�AĴ�p��R�O�C��J c:\temp\ �˵��ĪG 
+Note: 
+	1. ���{���ϥ�dirent.h�A�Ӽ��Y�ɩw�q�ؿ����c����ƫ��A�A�Ӽ��Y�ɦ�� 
+	   C:\Program Files (x86)\Dev-Cpp\MinGW64\x86_64-w64-mingw32\include 
+	2. �R�O�C��J���Φ������� c:\\temp\\ ����a������ܿ�J c:\temp\ �Y�i��
+	   �T����A�ݨӤ�ݦb���|�y�z���r�ꤤ�hµ���˱׽u�A�ЦP�ǹ�ı���ӷL�t��
+	3. Dev-C++���Ѫ�dirent.h�ҩw�q��dirent���c�p�U�G
+	   struct dirent
+		{
+			long			d_ino;		// Always zero
+			unsigned short	d_reclen;	// Always zero
+			unsigned short	d_namlen;	// Length of name in d_name
+			char			d_name[260];// File name
+		}; 
+*/
+
+#include <stdio.h> 
+#include <stdlib.h>
+#include <string.h>
+#include <dirent.h> 
+
+int main()
+{ 
+	DIR    *dpdf;	//�ŧi���|���A���� ��opendir�f�t �ΨӦs���}�Ҹ��|���O�����m 
+	struct dirent *epdf;
+	char   directoryPath[128], fileName[256];
+	long   i, fileSize, fileCount;
+	FILE   *fp;
+
+	system("cls");
+	printf("\n��J�ؿ������| ==> ");
+	scanf("%127[^\n]%*c",directoryPath); 
+	
+	if ((dpdf=opendir(directoryPath)) == NULL) { //opendir��DIR���A�h����m 
+		printf("�ؿ����s�b!\n");
+		return -1;
+	}
+	printf("�ؿ������Ҧ��ɮ׸�T�p�U ...\n=============================================\n");
+	while (epdf = readdir(dpdf)) { //Ū���ɮשҦb�ؿ��A�u�ndpdf�ҫ����e���šA�Y�N���ۦ��ɮצs�b�A�]���i�J�j��B�z		
+		if (strcmp(epdf->d_name,".")==0 || strcmp(epdf->d_name,"..")==0) continue; //�o����ɦW�@�w�|�s�b �@�w�n�ư� �]���o�O�t�Φ۰ʥͦ��� �]�|�۰����� ���Alinux���|�Q���� 
+		sprintf(fileName,"%s%s",directoryPath,epdf->d_name); // ������|+�ɦW
+		if ((fp=fopen(fileName,"rb")) == NULL) { // �}���ɮסA�}�ɼҦ���"��J+��X+��r�D��r�q�Y" 
+			//printf("File open error\n"); 
+			printf("%-50s *�l�ؿ�*\n",epdf->d_name);
+		}
+		else {
+			fseek(fp,0,SEEK_END); /* �ɮ�Ū�g�Y���̧ܳ��� */
+			fileSize = ftell(fp); /* �򪾩Ҧb��m�A���⬰�ɮת��� */
+			fclose(fp);
+			printf("%-50s %d bytes\n",epdf->d_name,fileSize);
+			fileCount++;
+		}
+	}
+	
+	closedir(dpdf); //�����ؿ���Ƶ��c 	
+	printf("=============================================\n��Ƨ����@��%d�ɮ�!\n",fileCount);
+
+	return 0;
+}
+
+
diff --git a/作業/unit5/factorUsingIterative.c b/作業/unit5/factorUsingIterative.c
new file mode 100644
index 0000000..906f71f
--- /dev/null
+++ b/作業/unit5/factorUsingIterative.c
@@ -0,0 +1,57 @@
+/*
+    file name: factorUsingIterative.c
+    Description: Factorial numbers count using iterative
+    �Q�ΰj�鰵N�������p��
+*/
+
+#include <stdio.h>
+#include <ctype.h>
+#include <stdlib.h>
+
+/* ��ƭ쫬�ŧi */
+long Factorial(long);
+void flushBuffer(void);
+
+int main()
+{
+    char ch;
+    long n;
+
+    printf("-----Factorial counting using Iterative-----");
+    do {
+        printf("\nEnter a number(0 <= n <= 12) to count n!: ");
+        scanf("%ld",&n);
+        flushBuffer();
+        if (n < 0 || n > 12)
+            printf("Input out of range!\n");
+        else
+            printf("%ld! = %ld\n", n, Factorial(n));
+
+        printf("Continue(y/n)? ");
+        ch = toupper(getchar());
+    } while (ch == 'Y');
+
+    return 0;
+}
+
+long Factorial(long n)
+{
+    long sum = 1;
+    int  i;
+
+    if (n == 0 || n ==1)  /* �� n=0 �� n=1 ��, 0!=1, 1!=1 */
+        return (1);       /* �G�����Ǧ^1 */
+    else {
+        for (i = 2; i<= n; i++)   /* sum �O���ثe�������M */
+            sum *= i;             /* sum �P i �ۭ����M��^ sum �� */
+    }
+    return (sum);
+}
+
+void flushBuffer()
+{
+    while (getchar() != '\n') {
+        continue;
+    }
+}
+
diff --git a/作業/unit5/factorUsingIterative.o b/作業/unit5/factorUsingIterative.o
new file mode 100644
index 0000000..888169e
Binary files /dev/null and b/作業/unit5/factorUsingIterative.o differ
diff --git a/作業/unit5/factorUsingRecursive.c b/作業/unit5/factorUsingRecursive.c
new file mode 100644
index 0000000..4c0e5c1
--- /dev/null
+++ b/作業/unit5/factorUsingRecursive.c
@@ -0,0 +1,53 @@
+/*
+    file name: factorUsingRecursive.c
+    Description: �Q��j�I�s�p�� N ����
+*/
+
+#include <stdio.h>
+#include <ctype.h>
+#include <stdlib.h>
+
+/* ��ƭ쫬�ŧi */
+long Factorial(long);
+void flushBuffer(void);
+
+int main()
+{
+    char ch;
+    unsigned long n;
+ 
+    printf("-----Factorial counting Using Recursive----");
+    do {
+        printf("\nEnter a number( 0<=n<=12 ) to count n!: ");
+        scanf("%ld", &n);
+//        flushBuffer();
+        fflush(stdin);
+        /* n ���Ȧb�@��t�Τ��W�L 13 �|���� overflow �o�줣���T���� */
+        if (n < 0 || n >12)
+            printf("�W�X�d��!\n");
+        else
+            printf("%ld! = %ld\n", n, Factorial(n) );
+        
+        printf("Continue(y/n)? ");
+        ch = toupper(getchar());
+    } while (ch == 'Y');
+    
+    return 0;
+}
+
+/* �Q�λ��j�I�s�ۤv�p��N ����*/
+long Factorial(long n)
+{
+    if ( n == 1 || n== 0)
+        return (1);
+    else
+        return( n * Factorial(n-1));
+}
+
+//void flushBuffer()
+//{
+//    while (getchar() != '\n') {
+//        continue;
+//    }
+//}
+
diff --git a/作業/unit5/factorUsingRecursive.o b/作業/unit5/factorUsingRecursive.o
new file mode 100644
index 0000000..a0cfaba
Binary files /dev/null and b/作業/unit5/factorUsingRecursive.o differ
diff --git a/作業/unit5/folder_info.cpp b/作業/unit5/folder_info.cpp
new file mode 100644
index 0000000..17e4405
--- /dev/null
+++ b/作業/unit5/folder_info.cpp
@@ -0,0 +1,98 @@
+#include <stdio.h> 
+#include <stdlib.h>
+#include <string.h>
+#include <dirent.h> 
+#include <sys/stat.h>  // �Ω��ˬd�O�_���ؿ�
+
+// �����ܼƫŧi
+FILE *fp;
+long fileCount = 0;
+
+// �s�W�Y�ƻ��U�禡
+void printIndent(int level) {
+	printf("|");
+    for(int i = 0; i < level; i++) {
+        printf("  ");  // �C�h�Y�ƨ�ӪŮ�
+    }
+}
+
+// �קאּ���j����
+void open_folder(char *path, int level) {
+    DIR *dir;
+    struct dirent *entry;
+    char fullPath[512];
+    struct stat statbuf;
+    long fileSize;
+
+    // �}�ҥؿ�
+    if ((dir = opendir(path)) == NULL) {
+        printf("�L�k�}�ҥؿ�: %s\n", path);
+        return;
+    }
+
+    // Ū���ؿ����e
+    while ((entry = readdir(dir)) != NULL) {
+        // ���L . �M ..
+        if (strcmp(entry->d_name, ".") == 0 || strcmp(entry->d_name, "..") == 0) 
+            continue;
+
+        // �c�ا�����|
+        snprintf(fullPath, sizeof(fullPath), "%s/%s", path, entry->d_name);
+        
+        // ���o�ɮ׸�T  
+        if (stat(fullPath, &statbuf) == -1) {
+            printf("�L�k���o�ɮ׸�T: %s\n", fullPath);
+            continue;
+        }
+
+        // �L�X�ثe�h�Ū��Y��
+        printIndent(level);
+
+        // �P�_�O�ؿ��٬O�ɮ�
+        if (S_ISDIR(statbuf.st_mode)) {
+            // �O�ؿ�
+            printf("[��Ƨ�] %s\n", entry->d_name);
+            // ���j�B�z�l�ؿ�
+            open_folder(fullPath, level + 1);
+        } else {
+            // �O�ɮ�
+            if ((fp = fopen(fullPath, "rb")) != NULL) {
+                fseek(fp, 0, SEEK_END);
+                fileSize = ftell(fp);
+                fclose(fp);
+                printf("  %s (%ld bytes)\n", entry->d_name, fileSize);
+                fileCount++;
+            } else {
+                printf("%s (�L�kŪ��)\n", entry->d_name);
+            }
+        }
+    }
+
+    closedir(dir);
+}
+
+int main() { 
+    char directoryPath[128];
+    
+    system("cls");
+    printf("\n��J�ؿ������| ==> ");
+    scanf("%127[^\n]%*c", directoryPath);
+    
+    // �������|�������׽u�]�p�G�����ܡ^
+    size_t len = strlen(directoryPath);
+    if (len > 0 && (directoryPath[len-1] == '\\' || directoryPath[len-1] == '/')) {
+        directoryPath[len-1] = '\0';
+    }
+    
+    if (opendir(directoryPath) == NULL) {
+        printf("�ؿ����s�b!\n");
+        return -1;
+    }
+    
+    printf("\n�ؿ����e���c�p�U�G\n=======================================\n");
+    open_folder(directoryPath, 0);
+    printf("=======================================\n");
+    printf("�`�@�� %ld ���ɮ�\n", fileCount);
+    
+    return 0;
+}
diff --git a/作業/unit5/folder_info.exe b/作業/unit5/folder_info.exe
new file mode 100644
index 0000000..592dc6e
Binary files /dev/null and b/作業/unit5/folder_info.exe differ
diff --git a/作業/unit5/gcd-indent.cpp b/作業/unit5/gcd-indent.cpp
new file mode 100644
index 0000000..6a042c2
--- /dev/null
+++ b/作業/unit5/gcd-indent.cpp
@@ -0,0 +1,31 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void gcd(int a , int b ){
+	int temp , r;
+	r = a % b;
+	
+	if(r!=0){
+		if(b>a){
+			temp = a;
+			a = b;
+			b = temp;
+		}
+		r = a % b;
+		printf("gcd(%d,%d)\n",a,b);
+		a = r;
+		
+		gcd(a,b);
+	}else{
+		printf("gcd(%d,%d)\n",b,a);
+		printf("\nans = %d",b);
+	}
+}
+
+int main(){
+	int a , b ,ans;
+	printf("��J��ӥ���� ==> ");
+	scanf("%d %d",&a,&b);
+	gcd(a,b);
+	return 0 ;
+}
diff --git a/作業/unit5/gcd-indent.exe b/作業/unit5/gcd-indent.exe
new file mode 100644
index 0000000..adf00bc
Binary files /dev/null and b/作業/unit5/gcd-indent.exe differ
diff --git a/作業/unit5/gcd.cpp b/作業/unit5/gcd.cpp
new file mode 100644
index 0000000..f00626b
--- /dev/null
+++ b/作業/unit5/gcd.cpp
@@ -0,0 +1,61 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void gcd(int a , int b ){
+	int temp , r;
+	r = a % b;
+	
+	if(r!=0){
+		if(b>a){
+			temp = a;
+			a = b;
+			b = temp;
+		}
+		r = a % b;
+		printf("gcd(%d,%d)\n",a,b);
+		a = r;
+		
+		gcd(a,b);
+	}else{
+		printf("gcd(%d,%d)\n",b,a);
+		printf("\nans = %d",b);
+	}
+}
+
+int main(){
+	int a , b ,ans;
+	printf("��J��ӥ���� ==> ");
+	scanf("%d %d",&a,&b);
+	gcd(a,b);
+	return 0 ;
+}
+
+
+//#include <stdio.h>
+//#include <stdlib.h>
+//
+//int gcd(int a, int b) {
+//    // �L�X���e�p��B�J
+//    printf("gcd(%d,%d)\n", a, b);
+//    
+//    // �򥻱��p�G�p�G b �� 0�A�h a ���̤j���]��
+//    if (b == 0) {
+//        return a;
+//    }
+//    
+//    // ���j�p��Ggcd(a,b) = gcd(b,a%b)
+//    return gcd(b, a % b);
+//}
+//
+//int main() {
+//    int a, b, ans;
+//    printf("��J��ӥ���� ==> ");
+//    scanf("%d %d", &a, &b);
+//    
+//    printf("%d\n",a % b);
+//    
+//    ans = gcd(a, b);
+//    printf("\nans = %d\n", ans);
+//    
+//    return 0;
+//}
diff --git a/作業/unit5/gcd.exe b/作業/unit5/gcd.exe
new file mode 100644
index 0000000..9fa73bd
Binary files /dev/null and b/作業/unit5/gcd.exe differ
diff --git a/作業/unit5/gcd.o b/作業/unit5/gcd.o
new file mode 100644
index 0000000..0465d14
Binary files /dev/null and b/作業/unit5/gcd.o differ
diff --git a/作業/unit5/narcissistic-number.cpp b/作業/unit5/narcissistic-number.cpp
new file mode 100644
index 0000000..6f8a47b
--- /dev/null
+++ b/作業/unit5/narcissistic-number.cpp
@@ -0,0 +1,85 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+// �p��b���w�i���U�����
+int getDigitCount(int num, int base) {
+    int count = 0;
+    while (num > 0) {
+        count++;
+        num /= base;
+    }
+    return count;
+}
+
+// �ˬd�O�_�����i������
+int isArmstrong(int num, int base) {
+    int originalNum = num;
+    int digitCount = getDigitCount(num, base);
+    int sum = 0;
+    
+    while (num > 0) {
+        int digit = num % base;
+        sum += pow(digit, digitCount);
+        num /= base;
+    }
+    
+    return (sum == originalNum);
+}
+
+// �N�Ʀr�ഫ�����w�i���r�����
+void printNumber(int num, int base) {
+    if (num < 10) {
+        printf("%d", num);
+    } else {
+        printf("%c", 'A' + (num - 10));
+    }
+}
+
+int main() {
+    int count = 0;
+    int targetCount;
+    int base;
+    int num = 1;
+    
+    printf("�p��h�֭Ӫ��i������? ==> ");
+    scanf("%d", &targetCount);
+    
+    printf("��J��(<16) ==> ");
+    scanf("%d", &base);
+    
+    if (base < 2 || base > 16) {
+        printf("�򩳥����b2��15����\n");
+        return 1;
+    }
+    
+    printf("\n�b%d�i���U���e%d�Ӫ��i�����ơG\n", base, targetCount);
+    
+    while (count < targetCount) {
+        if (isArmstrong(num, base)) {
+            printf("#%d\t", count + 1);
+            
+            // �L�X�Ʀr���i������
+            int temp = num;
+            int digits[32];
+            int digitCount = 0;
+            
+            // �ഫ�����w�i���
+            while (temp > 0) {
+                digits[digitCount++] = temp % base;
+                temp /= base;
+            }
+            
+            // �ϦV�L�X�Ʀr
+            for (int i = digitCount - 1; i >= 0; i--) {
+                printNumber(digits[i], base);
+            }
+            printf("\n");
+            
+            count++;
+        }
+        num++;
+    }
+    
+    return 0;
+}
diff --git a/作業/unit5/narcissistic-number.exe b/作業/unit5/narcissistic-number.exe
new file mode 100644
index 0000000..be8c25e
Binary files /dev/null and b/作業/unit5/narcissistic-number.exe differ
diff --git a/作業/unit5/narcissistic-number_claude.cpp b/作業/unit5/narcissistic-number_claude.cpp
new file mode 100644
index 0000000..6f8a47b
--- /dev/null
+++ b/作業/unit5/narcissistic-number_claude.cpp
@@ -0,0 +1,85 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+// �p��b���w�i���U�����
+int getDigitCount(int num, int base) {
+    int count = 0;
+    while (num > 0) {
+        count++;
+        num /= base;
+    }
+    return count;
+}
+
+// �ˬd�O�_�����i������
+int isArmstrong(int num, int base) {
+    int originalNum = num;
+    int digitCount = getDigitCount(num, base);
+    int sum = 0;
+    
+    while (num > 0) {
+        int digit = num % base;
+        sum += pow(digit, digitCount);
+        num /= base;
+    }
+    
+    return (sum == originalNum);
+}
+
+// �N�Ʀr�ഫ�����w�i���r�����
+void printNumber(int num, int base) {
+    if (num < 10) {
+        printf("%d", num);
+    } else {
+        printf("%c", 'A' + (num - 10));
+    }
+}
+
+int main() {
+    int count = 0;
+    int targetCount;
+    int base;
+    int num = 1;
+    
+    printf("�p��h�֭Ӫ��i������? ==> ");
+    scanf("%d", &targetCount);
+    
+    printf("��J��(<16) ==> ");
+    scanf("%d", &base);
+    
+    if (base < 2 || base > 16) {
+        printf("�򩳥����b2��15����\n");
+        return 1;
+    }
+    
+    printf("\n�b%d�i���U���e%d�Ӫ��i�����ơG\n", base, targetCount);
+    
+    while (count < targetCount) {
+        if (isArmstrong(num, base)) {
+            printf("#%d\t", count + 1);
+            
+            // �L�X�Ʀr���i������
+            int temp = num;
+            int digits[32];
+            int digitCount = 0;
+            
+            // �ഫ�����w�i���
+            while (temp > 0) {
+                digits[digitCount++] = temp % base;
+                temp /= base;
+            }
+            
+            // �ϦV�L�X�Ʀr
+            for (int i = digitCount - 1; i >= 0; i--) {
+                printNumber(digits[i], base);
+            }
+            printf("\n");
+            
+            count++;
+        }
+        num++;
+    }
+    
+    return 0;
+}
diff --git a/作業/unit5/narcissistic-number_claude.exe b/作業/unit5/narcissistic-number_claude.exe
new file mode 100644
index 0000000..f2355ba
Binary files /dev/null and b/作業/unit5/narcissistic-number_claude.exe differ
diff --git a/作業/unit5/number-conversion'.c b/作業/unit5/number-conversion'.c
new file mode 100644
index 0000000..2332a27
--- /dev/null
+++ b/作業/unit5/number-conversion'.c
@@ -0,0 +1,43 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+char ans[20];
+
+int i ;
+
+void convert(int n, int b);
+
+void convert(int n, int b){
+	if(n==0) return;
+	convert( n / b , b);
+	
+	if(n % b <10){
+		printf("%c",n % b + '0');
+	}else {
+		printf("%c",(n % b)-10 + 'A');
+	}
+
+}
+
+int main(){
+	int n , b ,count ;
+	while(1){
+		i = 0;
+		printf("\n��J���ഫ���Q�i�쥿��� ==> ");
+		scanf("%d",&n);
+		
+		if(n<=-1) break;
+		
+		printf("\n��J�ഫ���� ==> ");
+		scanf("%d",&b);
+		printf("(%d)_10 = (",n);
+		
+		convert(n,b);
+
+		printf(")_%d\n",b);
+	}
+	printf("\n�{���N����...");
+	system("pause");
+	
+	return 0;
+}
diff --git a/作業/unit5/number-conversion'.exe b/作業/unit5/number-conversion'.exe
new file mode 100644
index 0000000..c06ac04
Binary files /dev/null and b/作業/unit5/number-conversion'.exe differ
diff --git a/作業/unit5/number-conversion.c b/作業/unit5/number-conversion.c
new file mode 100644
index 0000000..c008c9f
--- /dev/null
+++ b/作業/unit5/number-conversion.c
@@ -0,0 +1,43 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int ans[20], i;
+
+void convert(int n, int b);
+
+void convert(int n, int b){
+	
+	if(n==0) return;
+	convert( n / b , b);
+//	if(n<b){
+//		ans[i--] = n;
+//		return;
+//	}
+//	ans[i--] = n % b;
+	printf("%d",n % b);
+	
+}
+
+int main(){
+	int n , b ,count ;
+	while(1){
+		i = 20;
+		printf("\n��J���ഫ���Q�i�쥿��� ==> ");
+		scanf("%d",&n);
+		
+		if(n<=-1) break;
+		
+		printf("\n��J�ഫ���� ==> ");
+		scanf("%d",&b);
+		printf("(%d)_10 = (",n);
+		convert(n,b);
+//		for(count=i+1;count<21;count++){
+//			printf("%d",ans[count]);
+//		}
+		printf(")_%d\n",b);
+	}
+	printf("\n�{���N����...");
+	system("pause");
+	
+	return 0;
+}
diff --git a/作業/unit5/number-conversion.exe b/作業/unit5/number-conversion.exe
new file mode 100644
index 0000000..b3d4055
Binary files /dev/null and b/作業/unit5/number-conversion.exe differ
diff --git a/作業/unit5/partition_integer.cpp b/作業/unit5/partition_integer.cpp
new file mode 100644
index 0000000..2e9da3b
--- /dev/null
+++ b/作業/unit5/partition_integer.cpp
@@ -0,0 +1,35 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void PrintPartitions(int n, int max, int* partition, int index) {
+    // �򥻱��p
+    if (n == 0) {
+        // �� n �� 0 �ɡA���ܧ��@�ؤ��Τ覡�A��X���G
+        for (int i = 0; i < index; i++) {
+            printf("%d", partition[i]);
+            if (i < index - 1) {
+                printf(" ");
+            }
+        }
+        printf("\n");
+        return;
+    }
+
+    // ���j���p
+    for (int i = (max > n) ? n : max; i >= 1; i--) {
+        partition[index] = i;
+        PrintPartitions(n - i, i, partition, index + 1);
+    }
+}
+
+int main() {
+    int num;
+    printf("��J����������� ==> ");
+    scanf("%d", &num);
+
+    int* partition = (int*) calloc(num, sizeof(int));
+    PrintPartitions(num, num, partition, 0);
+
+    free(partition);
+    return 0;
+}
diff --git a/作業/unit5/partition_integer.exe b/作業/unit5/partition_integer.exe
new file mode 100644
index 0000000..329a713
Binary files /dev/null and b/作業/unit5/partition_integer.exe differ
diff --git a/作業/unit5/prime-factoring-array.c b/作業/unit5/prime-factoring-array.c
new file mode 100644
index 0000000..b93e7f3
--- /dev/null
+++ b/作業/unit5/prime-factoring-array.c
@@ -0,0 +1,42 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void factor(int n , int i ){
+	int count = 0;
+	
+	if(n==i) {
+		printf(" x %d",i);
+		return;
+	}
+	
+	if(n<=1) return;
+	
+	while (n % i ==0){
+		count++;
+		n /= i;
+	} 
+	
+	if(count>1 ) printf(" x %d^%d",i,count);
+	else if (count==1 ) printf(" x %d",i);
+	
+	factor(n , i+1);
+}
+
+int main(){
+	int i= 2 , n ;
+	printf("��J�@�ӥ���ƨöi��]������\n");
+	printf("��J�Ʀr ==> ");
+	scanf("%d",&n);
+	if(n==2) {
+		printf("\n%d = 1 x 2",n);
+	}else{
+		printf("\n%d = 1",n);
+	} 
+	
+	factor(n,i);
+	
+	printf("\n");
+	system("pause");	
+	
+	return 0;
+}
diff --git a/作業/unit5/prime-factoring-array.exe b/作業/unit5/prime-factoring-array.exe
new file mode 100644
index 0000000..c09a0d1
Binary files /dev/null and b/作業/unit5/prime-factoring-array.exe differ
diff --git a/作業/unit5/river_in_tower.cpp b/作業/unit5/river_in_tower.cpp
new file mode 100644
index 0000000..4aa3af5
--- /dev/null
+++ b/作業/unit5/river_in_tower.cpp
@@ -0,0 +1,25 @@
+#include <stdio.h>
+
+
+void move(int n, char A, char B, char C)
+{
+	if (n == 1) {
+
+		printf("��L1�q%c�ηh��%c��\n",A,C);
+		return;
+	}
+	
+	move(n-1,A,C,B);
+
+	printf("��L%d�q%c�ηh��%c��\n",n,A,C);
+	move(n-1,B,A,C);
+}
+
+int main()
+{
+	int n = 3; /* ��L�`�� */
+	move(n,'A','B','C'); /* A�BB�BC�O�άW���W�� */
+	
+	return 0;
+}
+
diff --git a/作業/unit5/river_in_tower.exe b/作業/unit5/river_in_tower.exe
new file mode 100644
index 0000000..87882b2
Binary files /dev/null and b/作業/unit5/river_in_tower.exe differ
diff --git a/作業/unit5/try_DS5.cpp b/作業/unit5/try_DS5.cpp
new file mode 100644
index 0000000..6b65f34
--- /dev/null
+++ b/作業/unit5/try_DS5.cpp
@@ -0,0 +1,117 @@
+#include <math.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+int priority(char op) {
+    switch(op) {
+        case '+' : case '-' : return 1;
+        case '*' : case '/' : case '%' : return 2;
+        case '^' : return 3;
+        default : return 0;
+    }
+}
+
+void printf_postfix(char str[105][10], int len) {
+    int i = 0;
+    for (i = 0; i < len; i++) {
+        if (str[i][0] != '0') printf("%s ", str[i]);
+    }
+    printf("\n");
+}
+
+double cal(char op, double p1, double p2) {
+    switch(op) {
+        case '+' : return p1 + p2;
+        case '-' : return p1 - p2;
+        case '*' : return p1 * p2;
+        case '/' : return p1 / p2;
+        case '%' : return (int)p1 % (int)p2;
+        case '^' : return pow(p1, p2);
+    }
+}
+
+void oper(char str[105][10], int len) {
+    double now[105] = {0.0};
+
+    int L = 0, top = 0;
+    while (L < len) {
+        switch(str[L][0]) {
+            case '+' : case '-' : case '*' : case '/' : case '%' : case '^' :
+                now[top-1] = cal(str[L][0], now[top-1], now[top]);
+                top--;
+                break;
+            default :
+                now[++top] = atof(str[L]);
+        }
+        L++;
+    }
+    printf("\n�B�⵲�G=%5f\n\n", now[top]);
+}
+
+void infix_to_postfix(char* str) {
+    char infix[105][10] = {' '}, stack[105], now[10];
+
+    int L = 0, R = 0, top = 0, i, j, flag = 0;
+    while (str[L] != '\0') {
+        switch(str[L]) {
+            case '(' :
+                stack[++top] = str[L];
+                if (str[L+1] == '-') { flag = 1; L++; }
+                break;
+            case ')' :
+                while (stack[top] != '(') {
+                    infix[R++][0] = stack[top--];
+                }
+                top--;
+                break;
+            case '+' : case '-' : case '*' : case '/' : case '%' : case '^' :
+                while (priority(stack[top]) >= priority(str[L])) {
+                    infix[R++][0] = stack[top--];
+                }
+                stack[++top] = str[L];
+                if (str[L+1] == '-') { flag = 1; L++; }
+                break;
+            default :
+                i = 0;
+                while (str[L] == '.' || (str[L] >= '0' && str[L] <= '9')) {
+                    now[i++] = str[L++];
+                }
+                if (flag) {
+                    infix[R][0] = '0'; infix[R+2][0] = '-'; flag = 0;
+                    for (j = 0; j < i; j++) infix[R+1][j] = now[j];
+                    R += 2;
+                } else {
+                    for (j = 0; j < i; j++) infix[R][j] = now[j];
+                }
+                L--; R++;
+        }
+        L++;
+    }
+
+    while (top) {
+        infix[R++][0] = stack[top--];
+    }
+
+    printf_postfix(infix, R);
+    oper(infix, R);
+}
+
+int main() {
+    printf("%5f", 1+sin((-50.2+sin(3.8*20)*cos(-30-100%40))*pow(2, -2.5))*cos(123.456));
+    char str[105] = {'\0'};
+    while (printf("��J���Ǧ�(�䴩+ - * / ^ () sin() cos()�B��) => ")) {
+        scanf("%s", str);
+
+        printf("\n��������Ǧ��G");
+        infix_to_postfix(str);
+    }
+    return 0;
+}
+
+/*
+10+20*(50-30)/2^4-6*8
+10.5+20.8*(50.1-30.6)/2.5^4-6.6*8.2
+10-30*(-40-20)%2^4+7.5*-6
+1+sin((-50.2+sin(3.8*20)*cos(-30-100%40))*2^-2.5)*cos(123.456)
+*/
+
diff --git a/作業/unit5/try_DS5.exe b/作業/unit5/try_DS5.exe
new file mode 100644
index 0000000..228fff4
Binary files /dev/null and b/作業/unit5/try_DS5.exe differ
diff --git a/作業/unit7/DS6.cpp b/作業/unit7/DS6.cpp
new file mode 100644
index 0000000..ea18903
--- /dev/null
+++ b/作業/unit7/DS6.cpp
@@ -0,0 +1,334 @@
+/*Notes: ��J�i�� 
+	w={"Mary":10, "Tom":3, "Charlie":5, "Bob":6, "Dickens":20, 4:9, "z":0, "Za":12, "aZ":8}
+	w={10:10, 20:3, 5:5, 17:6, 23:20, 18:9, 3:0, 9:12}
+	w={10:10, 5:5, 9:6, 3:20, 7:9}
+	w={"A":10, "B":3, "Charlie":5, "Bob":6, "Dickens":20}
+	w={"A":6,"B":5,"C":3,"D":10}
+	w={"A":6,"B":5}
+	del w["A"]
+	del w["Dickens"]
+	del w["Mary"]
+	del w["aZ"]
+	del w
+	w["Mary"]=1
+	w["Tom"]+=2
+	w[4]?
+	w?
+*/
+
+#include <stdio.h>	/* for sscanf(), printf() */
+#include <stdlib.h>	
+#include <string.h>	/* for strstr(), strtok(), strtok_r() */
+#include <conio.h> 
+
+/* �w�qstudent���c */
+typedef struct student {
+    char name[20];  /* �ǥͩm�W */
+    int score;  /* �ǥͦ��Z */
+    struct student *llink;  /* ���l�쵲 */
+    struct student *rlink;  /* �k�l�쵲 */
+}student;
+
+void show(void);      /* ��X��� */
+void insert(char [], int);  /* �N��ƥ[�J�G���j�M�� */
+void removing(char []);  /* �N��Ʊq�G���j�M�𤤲��� */
+void inorder(struct student *);  /* ��ƥH���Ǫk��X */
+void free_all_nodes(struct student *node);
+void find_newroot(void);  /* �j�M�s�����`�I */
+
+student *search_p(struct student *node);
+student *search(char []);  /* �j�M�`�I */
+
+student *root, *ptr, *prev;
+
+int main(){ 
+	char  *token, key[12], line[128];
+	const char *s = " ={},";	/* ���j�ŰO���r�� */ 
+	int   value;
+	char  *rest ,choice[3];
+	
+   	printf("��J�s���r�媺���z�A�w��<Enter>�����{��\n");
+   	while (1) {
+   		printf("\n���O => ");
+   		fgets(line,128,stdin);		/* �ϥ�gets()Ū���]�i�H�A���]gets()���]Ū�J�r���ƪ�����A�i��ɭP�x�s��J�r�����}�C�Ŷ��z�� */ 
+   		if (line[0]=='\n') break;	/* ��J�Ŧr��h�������j�� */ 
+   		if (strstr(line,"{")) {		/* line�t��"{" */ 
+   			sscanf(line,"w = {%[^}]}",line);
+			rest = line;
+			while (token = strtok_r(rest,s,&rest)) { /* strtok_r()���Ϊk�i�Ѩ� http://bit.ly/3VcvbbZ */ 
+    			/* printf("%s\n",token); */ 
+    			if (strstr(token,":")) {/* token�t��":" */ 
+    				sscanf(token,"%[^:]:%d",key,&value);
+    				insert(key,value);
+//    				printf("Token #%d: ��=%s; ��=%d\n",++i,key,value);
+				} 
+   			}
+		}else if (strstr(line,"del")) {
+		    if(strcmp(line,"del w\n")==0){
+		        printf("�L�k�PŪ�N�R�����@�Ӥ����A�N�R����Ӧr��(y/n) => ");
+		        fgets(choice, sizeof(choice), stdin);
+		        if(strcmp(choice,"y\n")==0){
+		            free_all_nodes(root);
+					root = NULL;
+		        }else{
+		            printf("�����R���Ҧ��r��\n");
+		        }
+		    }else{
+		        if(sscanf(line,"del w[%[^]]]",key)==1){
+		        	if(strcmp(key,root->name)==0){
+	//		        	printf("�R��������w[%s]��root�`�I\n",key);
+						find_newroot();
+	//					printf("�s��root�`�I��w[%s]\n",root->name);
+					}else{
+						removing(key);
+					}
+				}
+		    }
+		}else if (strstr(line,"+=")) {	/* line�t��"+=" */ 
+   			sscanf(line,"w[%[^]]] +=%d",key,&value);
+   			student *modify_node;
+		   	if((modify_node = search(key)) == NULL){  /* �䤣���ƫh��ܿ��~ */
+		        printf("���~! %s ���b���G���j�M��!\n", key); 
+		    }else{
+		    	modify_node->score += value;
+				printf("�s�]w[%s]=%d\n",key,modify_node->score);
+			}
+		}else if (strstr(line,"=")) {	/* line�t��"=" */
+   			sscanf(line,"w[%[^]]] = %d",key,&value);
+   			student *add_node;
+   			if (root == NULL){
+			   insert(key,value);
+			   printf("�s�]w[%s]=%d\n",key,root->score);
+			}else{
+				if((add_node = search(key)) == NULL){  /* �䤣���ƫh�s�W��� */
+			   		insert(key,value);
+			        printf("%s ���b���G���j�M��!\n", key); 
+			        printf("�s�]w[%s]=%d\n",key,value);
+			    }else{
+			    	add_node->score = value;
+			    	printf("�s�]w[%s]=%d\n",key,add_node->score);
+				}
+			} 
+		}else if (sscanf(line,"w[%[^]]]?",key)==1){
+			student *read_node; 
+		   	if((read_node = search(key)) == NULL){  /* �䤣���ƫh�s�W��� */
+		        printf("���~! %s ���b���G���j�M��!\n", key); 
+		    }else{
+		    	printf("�r�夸��w[%s]=%d\n",key,read_node->score);
+			}
+		}else if (strstr(line,"?")) show();
+		else printf("�y�k�L�k��{�Asorry!\n");
+	}
+   	
+   	printf("\n�{�������Abye ~\n");
+   	return 0;
+}
+
+/* �B�z�G���j�M��A�N�s�W��ƥ[�J�ܤG���j�M�� */
+void insert(char name[], int score){
+    struct student *node, *prev;
+    /* ��Ƥw�s�b�h��ܿ��~ */
+    if (search(name) != NULL) {
+        printf("%s �w�s�b!\n", name);
+        return;
+    }
+    ptr = (struct student *) malloc(sizeof(struct student));
+    strcpy(ptr->name, name);
+    ptr->score = score;
+    ptr->llink = ptr->rlink = NULL;
+    if (root == NULL)  /* ���ڸ`�I��NULL�����p */
+        root = ptr;
+    else { /* ���ڸ`�I����NULL�����p */
+        node = root;
+        while (node != NULL) { /* �j�M��ƴ��J�I */
+            prev = node;
+            if(strcmp(ptr->name, node->name) < 0)
+                node = node->llink;
+            else
+                node = node->rlink;
+        }
+        if (strcmp(ptr->name, prev->name) < 0)
+            prev->llink = ptr;
+        else
+            prev->rlink = ptr;
+    }
+}
+
+/* �N��Ʊq�G���j�M�𤤲��� */
+void removing(char name[]){
+    student *del_node = search(name);
+    if (del_node == NULL) {
+        printf("%s ���b���G���j�M��!\n", name);
+        return;
+    }
+    
+    student *parent = search_p(del_node);
+    
+    // �B�z�S���l�`�I�����p
+    if (del_node->llink == NULL && del_node->rlink == NULL) {
+        if (parent->llink == del_node) {
+            parent->llink = NULL;
+        } else {
+            parent->rlink = NULL;
+        }
+    }else if (del_node->llink == NULL || del_node->rlink == NULL) {  // �B�z�@�䦳�l�`�I�����p
+        student *child = (del_node->llink != NULL) ? del_node->llink : del_node->rlink;
+        if (parent->llink == del_node) {
+            parent->llink = child;
+        } else {
+            parent->rlink = child;
+        }
+    }else{ //�B�z���䦳�l�`�I�����p
+    	if(del_node == parent->rlink){
+    		parent->rlink = del_node->llink;
+    		if(del_node->llink->rlink != NULL){ //�Y�R�����`�I���l�`�I�٦��k�`�I�����p
+    			student *child = del_node->llink->rlink;
+    			printf("%s\n",child->name);
+    			while(child->rlink!= NULL){ //��k�`�I����̩� 
+    				child = child->rlink;
+    				printf("%s\n",child->name);
+				}
+				child->rlink = del_node->rlink;
+			}else parent->rlink->rlink = del_node->rlink;  //�S���h��������
+    		
+		}else{
+			parent->llink = del_node->llink;
+			if(del_node->rlink->llink != NULL){ //�Y�R�����`�I���l�`�I�٦����`�I�����p 
+    			student *child = del_node->rlink->llink;
+    			printf("%s\n",child->name);
+    			while(child->llink!= NULL){ //�䥪�`�I����̩� 
+    				child = child->llink;
+    				printf("%s\n",child->name);
+				}
+				child->llink = del_node->llink;
+			}else parent->llink->rlink = del_node->rlink; //�S���h��������
+		}  
+	}
+    free(del_node);  /* ����O���� */
+	printf("�R��w[%s]����\n",name);
+}
+
+/* ��X��ơA�N��ƿ�X�ܿù� */
+void show(void){
+    /* �P�_�ڸ`�I�O�_��NULL */
+    if (root == NULL) {
+        puts("�G���j�M��O�Ū�!");
+        return;
+    }
+//    printf("root��%s\n", root->name);
+	printf("�r���ܼƤ����x�s������(key�Gvalue)�p�U\n");
+    inorder(root);  /* �H���Ǫk��X��� */
+}
+
+/* �H���Ǫk��X��ơA�Ļ��j�覡 */
+void inorder(struct student *node ){
+    if(node != NULL) {
+    
+        inorder(node->llink);
+        printf("%s�G%d\n", node->name, node->score);
+        inorder(node->rlink);
+    }
+}
+
+void find_newroot(){ /* �j�M�s�����`�I ���s���̤j��*/
+	struct student *newroot_node ,*prev;
+	
+	if(root->llink == NULL && root->rlink == NULL){
+		printf("�R��w[%s]����\n",root->name);
+		free(root);
+        root = NULL;
+		return;
+	}
+	
+	if(root->llink!=NULL){ //�䥪�s�����̤j��  
+		newroot_node = root->llink;
+		
+		while(newroot_node->rlink!=NULL){ //��ڪ����N�`�I 
+			prev = newroot_node;
+			newroot_node = newroot_node->rlink;
+		}
+		if(newroot_node->llink!=NULL){ //�Y�s���ڸ`�I�����`�I 
+			prev->rlink = newroot_node->llink;
+		}else prev->rlink = NULL;
+		
+		if(newroot_node != root->llink ){  //�Y�s���ڸ`�I������쥻�ڪ����`�I
+			newroot_node->llink = root->llink;
+			newroot_node->rlink = root->rlink;
+		}else{	//�Y�s���ڸ`�I����쥻�ڪ����`�I
+			newroot_node->rlink = root->rlink;
+		}
+		printf("�R��w[%s]����\n",root->name);
+		free(root);
+		root = newroot_node;
+	}else if(root->rlink!=NULL){ //��k�s�����̤p��  
+		newroot_node = root->rlink;
+		
+		while(newroot_node->llink!=NULL){ //��ڪ����N�`�I 
+			prev = newroot_node;
+			newroot_node = newroot_node->llink;
+		}
+		if(newroot_node->rlink!=NULL){ //�Y�s���ڸ`�I���k�`�I  
+			prev->llink = newroot_node->rlink;
+		}else prev->llink = NULL;
+		
+		if(newroot_node != root->rlink ){ //�Y�s���ڸ`�I������쥻�ڪ��k�`�I
+			newroot_node->llink = root->llink;
+			newroot_node->rlink = root->rlink;
+		}else{ //�Y�s���ڸ`�I����쥻�ڪ��k�`�I 
+			newroot_node->llink = root->llink;
+		}
+		printf("�R��w[%s]����\n",root->name);
+		free(root);
+		root = newroot_node;
+	}
+}
+
+/* �j�Mtarget�Ҧb�`�I */
+struct student *search(char target[]){
+    struct student *node;
+    node = root;
+    while(node != NULL){
+        if (strcmp(target, node->name) == 0)
+            return node;
+        else
+            /* target�p��ثe�`�I�A�����j�M */
+            if (strcmp(target, node->name) < 0)
+                node = node->llink;
+            else  /* target�j��ثe�`�I�A���k�j�M */
+                node = node->rlink;
+    }
+    return node;
+}
+
+/* �j�Mnode�����`�I */
+struct student *search_p(struct student *node){
+    struct student *parent;
+    parent = root;
+    while (parent != NULL) {
+        if (strcmp(node->name, parent->name) < 0) {
+            if (strcmp(node->name, parent->llink->name) == 0)
+                return parent;
+            else
+                parent = parent->llink;
+        }else {
+            if (strcmp(node->name, parent->rlink->name) == 0)
+                return parent;
+            else
+                parent = parent->rlink;
+        }
+    }
+    return NULL;
+}
+
+/* ���j����Ҧ��`�I���O���� */
+void free_all_nodes(struct student *node) {
+    if (node == NULL) return;
+    
+    // �����j���񥪤l��
+    free_all_nodes(node->llink);
+    // �A���j����k�l��
+    free_all_nodes(node->rlink);
+    printf("�R��'w[%s]=%d'�`�I\n",node->name,node->score);
+    // �̫�������e�`�I
+    free(node);
+}
diff --git a/作業/unit7/DS6.exe b/作業/unit7/DS6.exe
new file mode 100644
index 0000000..7f1f1b8
Binary files /dev/null and b/作業/unit7/DS6.exe differ
diff --git a/作業/unit7/Threaded Binary Tree.cpp b/作業/unit7/Threaded Binary Tree.cpp
new file mode 100644
index 0000000..8be507c
--- /dev/null
+++ b/作業/unit7/Threaded Binary Tree.cpp	
@@ -0,0 +1,454 @@
+/*Notes: ��J�i�� 
+	w={"Mary":10, "Tom":3, "Charlie":5, "Bob":6, "Dickens":20, 4:9, "z":0, "Za":12, "aZ":8}
+	w={10:10, 20:3, 5:5, 17:6, 23:20, 18:9, 3:0, 9:12}
+	w={10:10, 5:5, 9:6, 3:20, 7:9}
+	w={"A":10, "B":3, "C":5, "D":20 ,"E":30 }
+	w={"D":10, "C":3, "B":5, "A":6}
+	del w["A"]
+	del w["Dickens"]
+	del w["Mary"]
+	del w["aZ"]
+	del w 
+	w={"B":3, "A":10}
+	w["A"]=10
+	w["B"]=20
+	w["Tom"]+=2
+	w[4]?
+	w?
+*/
+
+#include <stdio.h>	/* for sscanf(), printf() */
+#include <stdlib.h>	
+#include <string.h>	/* for strstr(), strtok(), strtok_r() */
+#include <conio.h> 
+
+/* �w�qdict���c */
+typedef struct dict { 	/* �޽u�G���j�M��`�I����Ƶ��c�A��@�r�� */
+	 char key[20]; 		/* �����Ӹ`�I���u��v(key)���e */
+	 int value; 	/* �����u��v�������u�ȡv(value)���e */
+	 struct dict *llink; 	/* ���V���l��کΤ޽u�γ~ */
+	 struct dict *rlink; 	/* ���V�k�l��کΤ޽u�γ~ */
+	 int lbit; 		/* ���� llink �O�_�����`���� */
+	 int rbit; 		/* ���� rlink �O�_�����`���� */
+ } dict;
+
+void show(void);      /* ��X��� */
+void insert(char [], int);  /* �N��ƥ[�J�G���j�M�� */
+void insert_left(struct dict *s, struct dict *t);
+void insert_right(struct dict *s, struct dict *t);
+void removing(char []);  	/* �N��Ʊq�G���j�M�𤤲��� */
+void inorder(struct dict *);  /* ��ƥH���Ǫk��X */
+void free_all_nodes(struct dict *node);
+
+dict *search_p(struct dict *node);
+dict *search(char []);  /* �j�M�`�I */
+dict *insuc(dict *ptr);
+
+dict *root = NULL, *ptr, *prev ,*head = NULL ;
+
+int main(){ 
+
+	head = (dict *)malloc(sizeof(dict));
+    if (head == NULL) {
+        printf("�O������t���ѡI\n");
+        return 1;
+    }
+	head->lbit = head->rbit = 1;
+	head->rlink = head;
+	head->llink = root;
+	
+	char  *token, key[12], line[128];
+	const char *s = " ={},";	/* ���j�ŰO���r�� */ 
+	int   value;
+	char  *rest ,option;
+	
+   	printf("��J�s���r�媺���z�A�w��<Enter>�����{��\n");
+   	while (1) {
+   		printf("\n���O => ");
+   		fgets(line,128,stdin);		/* �ϥ�gets()Ū���]�i�H�A���]gets()���]Ū�J�r���ƪ�����A�i��ɭP�x�s��J�r�����}�C�Ŷ��z�� */ 
+   		if (line[0]=='\n') break;	/* ��J�Ŧr��h�������j�� */ 
+   		if (strstr(line,"{")) {		/* line�t��"{" */ 
+   			sscanf(line,"w = {%[^}]}",line);
+			rest = line;
+			while (token = strtok_r(rest,s,&rest)) { /* strtok_r()���Ϊk�i�Ѩ� http://bit.ly/3VcvbbZ */ 
+    			/* printf("%s\n",token); */ 
+    			if (strstr(token,":")) {/* token�t��":" */ 
+    				sscanf(token,"%[^:]:%d",key,&value);
+//    				printf("key=%s,value=%d\n",key,value);
+    				insert(key,value);
+				} 
+   			}
+		}else if (strstr(line,"del")) {
+			if(sscanf(line,"del w[%[^]]]",key)){
+				removing(key);
+				printf("\n�s��root�`�I��w[%s]\n",root->key);
+			}else{
+				printf("�L�k�PŪ�N�R�����@�Ӥ����A�N�R����Ӧr��? (y/n) => ");
+				scanf("%c",&option);
+				fflush(stdin);
+				if (option == 'y' || option == 'Y') {
+					free_all_nodes(root);
+					root = NULL;
+				}else{
+		            printf("�����R���Ҧ��r��\n");
+		        }	
+			}
+		}else if (strstr(line,"+=")) {	/* line�t��"+=" */ 
+   			sscanf(line,"w[%[^]]] +=%d",key,&value);
+   			dict *modify_node;
+		   	if((modify_node = search(key)) == NULL){  /* �䤣���ƫh��ܿ��~ */
+		        printf("���~! %s ���b���G���j�M��!\n", key); 
+		    }else{
+		    	modify_node->value += value;
+				printf("�s�]w[%s]=%d\n",key,modify_node->value);
+			}
+		}else if (strstr(line,"=")) {	/* line�t��"=" */
+   			sscanf(line,"w[%[^]]] = %d",key,&value);
+   			dict *add_node;
+   			if (root == NULL){
+			   insert(key,value);
+			   printf("�s�]w[%s]=%d\n",key,root->value);
+			}else{
+				if((add_node = search(key)) == NULL){  /* �䤣���ƫh�s�W��� */
+			   		insert(key,value);
+			        printf("%s ���b���G���j�M��!\n", key); 
+			        printf("�s�]w[%s]=%d\n",key,value);
+			    }else{
+			    	add_node->value = value;
+			    	printf("�s�]w[%s]=%d\n",key,add_node->value);
+				}
+			} 
+		}else if (sscanf(line,"w[%[^]]]?",key)==1){
+			dict *read_node; 
+		   	if((read_node = search(key)) == NULL){  /* �䤣���ƫh�s�W��� */
+		        printf("���~! %s ���b���G���j�M��!\n", key); 
+		    }else{
+		    	printf("�r�夸��w[%s]=%d\n",key,read_node->value);
+			}
+		}else if (strstr(line,"?")) show();
+		else printf("�y�k�L�k��{�Asorry!\n");
+	}
+	printf("\n�{�������A�R���Ҧ��`�I�Abye ~\n");
+	free_all_nodes(root);
+   	free(head);
+   	
+   	return 0;
+}
+
+void insert(char key[], int value) {
+    // �ˬd�O�_�w�s�b
+    if (search(key) != NULL) {
+        printf("%s �w�s�b!\n", key);
+        return;
+    }
+
+    // �إ߷s�`�I
+    ptr = (struct dict *) malloc(sizeof(struct dict));
+    strcpy(ptr->key, key);
+    ptr->value = value;
+    ptr->lbit = ptr->rbit = 0;
+	ptr->llink = ptr->rlink = head;  // ���T��l�Ƭ� NULL
+
+    // �B�z�ž𪺱��p
+    if (root == NULL) {
+        root = ptr;
+        head->llink = root;    // head �����쵲���V root
+        root->llink = head;    // root ������������V head
+        root->rlink = head;    // root ���k��������V head
+        return;
+    }
+
+    // �M�䴡�J��m
+    dict *current = root;
+    dict *parent;
+
+    while (1) {
+        parent = current;
+        if (strcmp(ptr->key, current->key) < 0) {  // ������
+            if (current->lbit == 0) {  // ��촡�J��m
+                insert_left(current, ptr);
+                break;
+            }
+            current = current->llink;
+        }else {  // ���k��
+            if (current->rbit == 0) {  // ��촡�J��m
+                insert_right(current, ptr);
+                break;
+            }
+            current = current->rlink;
+        }
+    }
+}
+
+// �b�Y�`�I���贡�J�s�`�I
+void insert_left(struct dict *s, struct dict *t) {
+    t->llink = s->llink;  // �s�`�I�����l�`�I���V��`�I�����l�`�I
+    t->rlink = s;          // �s�`�I���k�l�`�I���V��`�I
+    t->lbit = s->lbit;      // �s�`�I�~�ӭ�`�I�����줸��
+    t->rbit = 0;            // �]�w�k�줸���޽u 
+    s->llink = t;          // ��`�I�����l�`�I���V�s�`�I
+    s->lbit = 1;            // �]�w���줸�����`�쵲
+    
+    if (t->lbit == 1) {
+        dict *p = t->llink;
+        while (p->rbit == 1)
+            p = p->rlink;
+        p->rlink = t;
+    }
+}
+
+// �b�Y�`�I�k�贡�J�s�`�I
+void insert_right(struct dict *s, struct dict *t) {
+    t->rlink = s->rlink;  // �s�`�I���k�l�`�I���V��`�I���k�l�`�I
+    t->rbit = s->rbit;      // �s�`�I�~�ӭ�`�I���k�줸��
+    t->llink = s;          // �s�`�I�����l�`�I���V��`�I
+    t->lbit = 0;            // �]�w���줸���޽u 
+    s->rlink = t;          // ��`�I���k�l�`�I���V�s�`�I
+    s->rbit = 1;            // �]�w�k�줸�����`�쵲
+    
+    // �M��e�X�`�I�ç�s�޽u
+    if (t->rbit == 1) {
+        dict *p = t->rlink;
+        while (p->lbit == 1)
+            p = p->llink;
+        p->llink = t;
+    }
+}
+
+/* �N��Ʊq�G���j�M�𤤲��� */
+void removing(char key[]) {
+    dict *del_node = search(key);
+    if (del_node == NULL) {
+        printf("%s ���b���G���j�M��!\n", key);
+        return;
+    }
+    
+    dict *parent = search_p(del_node);
+    
+    //�Y�����`�I
+    if (del_node->lbit == 0 && del_node->rbit == 0) {
+        if (parent == NULL) {  // �R�����O�ڸ`�I
+            root = NULL;
+            head->llink = head;
+        } else if (parent->llink == del_node) {
+            parent->llink = del_node->llink;  // �~�ӥ��޽u 
+            parent->lbit = 0;
+        } else {
+            parent->rlink = del_node->rlink;  // �~�ӥk�޽u 
+            parent->rbit = 0;
+        }
+        free(del_node);
+    }
+    
+    // �Y�u�����l��
+    else if (del_node->lbit == 1 && del_node->rbit == 0) {
+        dict *left_child = del_node->llink;
+        dict *successor = del_node->rlink;  // �O�s���~�`�I
+        
+        // ��쥪�l�𪺳̥k�`�I
+        dict *rightmost = left_child;
+        while (rightmost->rbit == 1) {
+            rightmost = rightmost->rlink;
+        }
+        
+        // ��s�s��
+        rightmost->rlink = successor;
+        if (parent == NULL) {
+            root = left_child;
+            head->llink = root;
+        } else if (parent->llink == del_node) {
+            parent->llink = left_child;
+        } else {
+            parent->rlink = left_child;
+        }
+        free(del_node);
+    }
+    
+    // �Y�u���k�l��
+    else if (del_node->lbit == 0 && del_node->rbit == 1) {
+        dict *right_child = del_node->rlink;
+        dict *predecessor = del_node->llink;  // �O�s�e�X�`�I
+        
+        // ���k�l�𪺳̥��`�I
+        dict *leftmost = right_child;
+        while (leftmost->lbit == 1) {
+            leftmost = leftmost->llink;
+        }
+        
+        // ��s�s��
+        leftmost->llink = predecessor;
+        if (parent == NULL) {
+            root = right_child;
+            head->llink = root;
+        } else if (parent->llink == del_node) {
+            parent->llink = right_child;
+        } else {
+            parent->rlink = right_child;
+        }
+        free(del_node);
+    }
+    
+    // �Y����Ӥl��
+    else {
+        // �䥪�l�𤤳̤j���`�I
+        dict *predecessor = del_node->llink;
+        dict *pred_parent = del_node;
+        
+        while (predecessor->rbit == 1) {
+            pred_parent = predecessor;
+            predecessor = predecessor->rlink;
+        }
+        
+        // �ƻs���~�`�I���ƾڨ�Q�R���`�I
+        strcpy(del_node->key, predecessor->key);
+        del_node->value = predecessor->value;
+        
+        // �������~�`�I
+        if (pred_parent == del_node) {
+            del_node->llink = predecessor->llink;
+            del_node->lbit = predecessor->lbit;
+        } else {
+            pred_parent->rlink = predecessor->rlink;
+            pred_parent->rbit = predecessor->rbit;
+        }
+        
+        free(predecessor);
+    }
+    
+    printf("�R��w[%s]����\n", key);
+}
+
+void show(void) {
+    if (root == NULL) {
+        puts("�G���j�M��O�Ū�!");
+        return;
+    }
+    printf("�r���ܼƤ����x�s������(key�Gvalue)�p�U\n");
+    inorder(root);
+}
+
+// �ϥΤ޽u�S�ʶi�椤�ǹM��
+void inorder(dict *root) {
+	
+    if (root == NULL) {
+        printf("�G���j�M��O�Ū�!\n");
+        return;
+    }
+
+    dict *current = root;
+    
+    // �����̥��䪺�`�I
+    while (current->lbit == 1) {
+        current = current->llink;
+    }
+	
+	while (1) {
+		
+		printf("%s�G%d\n", current->key, current->value);
+
+        current = insuc(current);
+        
+        if (current == NULL || current == head) {
+            break;
+        }
+    }
+}
+
+// �M�䤤�ǫ��~�`�I
+dict *insuc(dict *ptr) {
+    if (ptr == NULL) return NULL;
+    
+    // �p�G���k�l��
+    if (ptr->rbit == 1) {
+        // ���ܥk�l��
+        ptr = ptr->rlink;
+        // �M��@�����������줣��A��
+        while (ptr->lbit == 1) {
+            ptr = ptr->llink;
+        }
+        return ptr;
+    }
+    // �p�G�S���k�l��A�h��^�k�޽u���V���`�I
+    return ptr->rlink;
+}
+
+/* �j�Mtarget�Ҧb�`�I */
+struct dict *search(char target[]) {
+    struct dict *node = root;
+    
+    while (node != NULL && node != head) {  // �[�J head ���ˬd�H������Y�`�I
+        int cmp = strcmp(target, node->key);
+        if (cmp == 0) {
+            return node;  // ���ؼи`�I
+        } else if (cmp < 0) {  // target �p��ثe�`�I�A�����j�M
+            if (node->lbit == 0) {  // �p�G����O�޽u 
+                return NULL;  // �N���䤣��ؼ�
+            }
+            node = node->llink;
+        } else {  // target �j��ثe�`�I�A���k�j�M
+            if (node->rbit == 0) {  // �p�G�k��O�޽u 
+                return NULL;  // �N���䤣��ؼ�
+            }
+            node = node->rlink;
+        }
+    }
+    return NULL;  // �䤣��ؼ�
+}
+
+/* �j�Mnode�����`�I */
+struct dict *search_p(struct dict *node) {
+    if (node == NULL || node == root) {
+        return NULL;
+    }
+
+    struct dict *current = root;
+    struct dict *parent = NULL;
+
+    while (current != NULL && current != head) {
+        int cmp = strcmp(node->key, current->key);
+        
+        if (cmp == 0) {  // ���ؼи`�I�A��^����`�I
+            return parent;
+        }
+        
+        parent = current;  // ��s���`�I
+        
+        if (cmp < 0) {  // �ؼЦb���l��
+            if (current->lbit == 0) {  // �p�G�O�޽u 
+                return NULL;  // �䤣��ؼ�
+            }
+            current = current->llink;
+        } else {  // �ؼЦb�k�l��
+            if (current->rbit == 0) {  // �p�G�O�޽u 
+                return NULL;  // �䤣��ؼ�
+            }
+            current = current->rlink;
+        }
+    }
+    
+    return NULL;  // �S�����ؼи`�I
+}
+
+// ����Ҧ��`�I
+void free_all_nodes(struct dict *root) {
+    if (root == NULL) {
+        return;
+    }
+
+    dict *current = root;
+    dict *temp;
+
+    // ���̥��䪺�`�I
+    while (current->lbit == 1) {
+        current = current->llink;
+    }
+
+    // �ϥΤ޽u�S�ʹM��������`�I
+    while (current != head) {
+        temp = current;
+        current = insuc(current);
+        printf("�R��'w[%s]=%d'�`�I\n", temp->key, temp->value);
+        free(temp);
+    }
+    root = NULL;
+}
diff --git a/作業/unit7/Threaded Binary Tree.exe b/作業/unit7/Threaded Binary Tree.exe
new file mode 100644
index 0000000..96f6a7d
Binary files /dev/null and b/作業/unit7/Threaded Binary Tree.exe differ
diff --git a/作業/unit7/Threaded Binary Tree_bit.cpp b/作業/unit7/Threaded Binary Tree_bit.cpp
new file mode 100644
index 0000000..a3c321c
--- /dev/null
+++ b/作業/unit7/Threaded Binary Tree_bit.cpp	
@@ -0,0 +1,524 @@
+/*Notes: ��J�i�� 
+	w={"Mary":10, "Tom":3, "Charlie":5, "Bob":6, "Dickens":20, 4:9, "z":0, "Za":12, "aZ":8}
+	w={10:10, 20:3, 5:5, 17:6, 23:20, 18:9, 3:0, 9:12}
+	w={10:10, 5:5, 9:6, 3:20, 7:9}
+	w={"A":10, "B":3, "C":5, "Bob":6, "D":20}
+	w={"D":10, "C":3, "B":5, "A":6}
+	del w["A"]
+	del w["Dickens"]
+	del w["Mary"]
+	del w["aZ"]
+	del w 
+	w={"B":3, "A":10}
+	w["A"]=10
+	w["B"]=20
+	w["Tom"]+=2
+	w[4]?
+	w?
+*/
+
+#include <stdio.h>	/* for sscanf(), printf() */
+#include <stdlib.h>	
+#include <string.h>	/* for strstr(), strtok(), strtok_r() */
+#include <conio.h> 
+
+/* �w�qdict���c */
+typedef struct dict { 	/* �޽u�G���j�M��`�I����Ƶ��c�A��@�r�� */
+	 char key[20]; 		/* �����Ӹ`�I���u��v(key)���e */
+	 int value; 	/* �����u��v�������u�ȡv(value)���e */
+	 struct dict *llink; 	/* ���V���l��کΤ޽u�γ~ */
+	 struct dict *rlink; 	/* ���V�k�l��کΤ޽u�γ~ */
+	 int lbit; 		/* ���� llink �O�_�����`���� */
+	 int rbit; 		/* ���� rlink �O�_�����`���� */
+ } dict;
+
+void show(void);      /* ��X��� */
+void insert(char [], int);  /* �N��ƥ[�J�G���j�M�� */
+void insert_left(struct dict *s, struct dict *t);
+void insert_right(struct dict *s, struct dict *t);
+void removing(char []);  	/* �N��Ʊq�G���j�M�𤤲��� */
+void inorder(struct dict *);  /* ��ƥH���Ǫk��X */
+void free_all_nodes(struct dict *node);
+void find_newroot(void);  	/* �j�M�s�����`�I */
+
+dict *search_p(struct dict *node);
+dict *search(char []);  /* �j�M�`�I */
+dict *insuc(dict *ptr);
+
+dict *root = NULL, *ptr, *prev ,*head = NULL ;
+
+int main(){ 
+
+	head = (dict *)malloc(sizeof(dict));
+    if (head == NULL) {
+        printf("�O������t���ѡI\n");
+        return 1;
+    }
+	head->lbit = head->rbit = 1;
+	head->rlink = head;
+	head->llink = root;
+	
+	char  *token, key[12], line[128];
+	const char *s = " ={},";	/* ���j�ŰO���r�� */ 
+	int   value;
+	char  *rest ,option;
+	
+   	printf("��J�s���r�媺���z�A�w��<Enter>�����{��\n");
+   	while (1) {
+   		printf("\n���O => ");
+   		fgets(line,128,stdin);		/* �ϥ�gets()Ū���]�i�H�A���]gets()���]Ū�J�r���ƪ�����A�i��ɭP�x�s��J�r�����}�C�Ŷ��z�� */ 
+   		if (line[0]=='\n') break;	/* ��J�Ŧr��h�������j�� */ 
+   		if (strstr(line,"{")) {		/* line�t��"{" */ 
+   			sscanf(line,"w = {%[^}]}",line);
+			rest = line;
+			while (token = strtok_r(rest,s,&rest)) { /* strtok_r()���Ϊk�i�Ѩ� http://bit.ly/3VcvbbZ */ 
+    			/* printf("%s\n",token); */ 
+    			if (strstr(token,":")) {/* token�t��":" */ 
+    				sscanf(token,"%[^:]:%d",key,&value);
+//    				printf("key=%s,value=%d\n",key,value);
+    				insert(key,value);
+//    				printf("Token #%d: ��=%s; ��=%d\n",++i,key,value);
+				} 
+   			}
+		}else if (strstr(line,"del")) {
+			if(sscanf(line,"del w[%[^]]]",key)){
+				if(strcmp(key,root->key)==0){
+//		        	printf("�R��������w[%s]��root�`�I\n",key);
+					find_newroot();
+//					printf("�s��root�`�I��w[%s]\n",root->key);
+				}else removing(key);
+			}else{
+				printf("�L�k�PŪ�N�R�����@�Ӥ����A�N�R����Ӧr��? (y/n) => ");
+				scanf("%c",&option);
+				fflush(stdin);
+				if (option == 'y' || option == 'Y') {
+					free_all_nodes(root);
+					root = NULL;
+				}else{
+		            printf("�����R���Ҧ��r��\n");
+		        }	
+			}
+		}else if (strstr(line,"+=")) {	/* line�t��"+=" */ 
+   			sscanf(line,"w[%[^]]] +=%d",key,&value);
+   			dict *modify_node;
+		   	if((modify_node = search(key)) == NULL){  /* �䤣���ƫh��ܿ��~ */
+		        printf("���~! %s ���b���G���j�M��!\n", key); 
+		    }else{
+		    	modify_node->value += value;
+				printf("�s�]w[%s]=%d\n",key,modify_node->value);
+			}
+		}else if (strstr(line,"=")) {	/* line�t��"=" */
+   			sscanf(line,"w[%[^]]] = %d",key,&value);
+   			dict *add_node;
+   			if (root == NULL){
+			   insert(key,value);
+			   printf("�s�]w[%s]=%d\n",key,root->value);
+			}else{
+				if((add_node = search(key)) == NULL){  /* �䤣���ƫh�s�W��� */
+			   		insert(key,value);
+			        printf("%s ���b���G���j�M��!\n", key); 
+			        printf("�s�]w[%s]=%d\n",key,value);
+			    }else{
+			    	add_node->value = value;
+			    	printf("�s�]w[%s]=%d\n",key,add_node->value);
+				}
+			} 
+		}else if (sscanf(line,"w[%[^]]]?",key)==1){
+			dict *read_node; 
+		   	if((read_node = search(key)) == NULL){  /* �䤣���ƫh�s�W��� */
+		        printf("���~! %s ���b���G���j�M��!\n", key); 
+		    }else{
+		    	printf("�r�夸��w[%s]=%d\n",key,read_node->value);
+			}
+		}else if (strstr(line,"?")) show();
+		else printf("�y�k�L�k��{�Asorry!\n");
+	}
+	printf("\n�{�������A�R���Ҧ��`�I�Abye ~\n");
+	free_all_nodes(root);
+   	free(head);
+   	
+   	return 0;
+}
+
+// �ק�᪺insert���
+void insert(char key[], int value) {
+    // �ˬd�O�_�w�s�b
+    if (search(key) != NULL) {
+        printf("%s �w�s�b!\n", key);
+        return;
+    }
+
+    // �إ߷s�`�I
+    ptr = (struct dict *) malloc(sizeof(struct dict));
+    strcpy(ptr->key, key);
+    ptr->value = value;
+    ptr->lbit = ptr->rbit = 0;
+	ptr->llink = ptr->rlink = NULL;  // ���T��l�Ƭ� NULL
+
+    // �B�z�ž𪺱��p
+    if (root == NULL) {
+        root = ptr;
+        head->llink = root;    // head �����쵲���V root
+        root->llink = head;    // root ������������V head
+        root->rlink = head;    // root ���k��������V head
+        return;
+    }
+
+    // �M�䴡�J��m
+    dict *current = root;
+    dict *parent;
+
+    while (1) {
+        parent = current;
+        if (strcmp(ptr->key, current->key) < 0) {  // ������
+            if (current->lbit == 0) {  // ��촡�J��m
+                insert_left(current, ptr);
+                break;
+            }
+            current = current->llink;
+        }else {  // ���k��
+            if (current->rbit == 0) {  // ��촡�J��m
+                insert_right(current, ptr);
+                break;
+            }
+            current = current->rlink;
+        }
+    }
+}
+
+// �b�Y�`�I���贡�J�s�`�I
+void insert_left(struct dict *s, struct dict *t) {
+    t->llink = s->llink;  // �s�`�I�����l�`�I���V��`�I�����l�`�I
+    t->rlink = s;          // �s�`�I���k�l�`�I���V��`�I
+    t->lbit = s->lbit;      // �s�`�I�~�ӭ�`�I�����줸��
+    t->rbit = 0;            // �]�w�k�줸�������
+    s->llink = t;          // ��`�I�����l�`�I���V�s�`�I
+    s->lbit = 1;            // �]�w���줸�����`�쵲
+    
+    if (t->lbit == 1) {
+        dict *p = t->llink;
+        while (p->rbit == 1)
+            p = p->rlink;
+        p->rlink = t;
+    }
+}
+
+// �b�Y�`�I�k�贡�J�s�`�I�]�ھڹϤ��ҥܡ^
+void insert_right(struct dict *s, struct dict *t) {
+    t->rlink = s->rlink;  // �s�`�I���k�l�`�I���V��`�I���k�l�`�I
+    t->rbit = s->rbit;      // �s�`�I�~�ӭ�`�I���k�줸��
+    t->llink = s;          // �s�`�I�����l�`�I���V��`�I
+    t->lbit = 0;            // �]�w���줸�������
+    s->rlink = t;          // ��`�I���k�l�`�I���V�s�`�I
+    s->rbit = 1;            // �]�w�k�줸�����`�쵲
+    
+    // �M��e�X�`�I�ç�s�޽u
+    if (t->rbit == 1) {
+        dict *p = t->rlink;
+        while (p->lbit == 1)
+            p = p->llink;
+        p->llink = t;
+    }
+}
+
+/* �N��Ʊq�G���j�M�𤤲��� */
+void removing(char key[]) {
+    dict *del_node = search(key);
+    if (del_node == NULL) {
+        printf("%s ���b���G���j�M��!\n", key);
+        return;
+    }
+    
+    dict *parent = search_p(del_node);
+    
+    // Case 1: ���`�I (�S���l�`�I)
+    if (del_node->lbit == 0 && del_node->rbit == 0) {
+        if (parent == NULL) {  // �R�����O�ڸ`�I
+            root = NULL;
+            head->llink = head;
+        } else if (parent->llink == del_node) {
+            parent->llink = del_node->llink;  // �~�ӥ������
+            parent->lbit = 0;
+        } else {
+            parent->rlink = del_node->rlink;  // �~�ӥk�����
+            parent->rbit = 0;
+        }
+        free(del_node);
+    }
+    
+    // Case 2: �u�����l��
+    else if (del_node->lbit == 1 && del_node->rbit == 0) {
+        dict *left_child = del_node->llink;
+        dict *successor = del_node->rlink;  // �O�s���~�`�I
+        
+        // ��쥪�l�𪺳̥k�`�I
+        dict *rightmost = left_child;
+        while (rightmost->rbit == 1) {
+            rightmost = rightmost->rlink;
+        }
+        
+        // ��s�s��
+        rightmost->rlink = successor;
+        if (parent == NULL) {
+            root = left_child;
+            head->llink = root;
+        } else if (parent->llink == del_node) {
+            parent->llink = left_child;
+        } else {
+            parent->rlink = left_child;
+        }
+        free(del_node);
+    }
+    
+    // Case 3: �u���k�l��
+    else if (del_node->lbit == 0 && del_node->rbit == 1) {
+        dict *right_child = del_node->rlink;
+        dict *predecessor = del_node->llink;  // �O�s�e�X�`�I
+        
+        // ���k�l�𪺳̥��`�I
+        dict *leftmost = right_child;
+        while (leftmost->lbit == 1) {
+            leftmost = leftmost->llink;
+        }
+        
+        // ��s�s��
+        leftmost->llink = predecessor;
+        if (parent == NULL) {
+            root = right_child;
+            head->llink = root;
+        } else if (parent->llink == del_node) {
+            parent->llink = right_child;
+        } else {
+            parent->rlink = right_child;
+        }
+        free(del_node);
+    }
+    
+    // Case 4: ����Ӥl��
+    else {
+        // ��줤�ǫ��~�`�I�]�k�l�𤤳̤p���`�I�^
+        dict *successor = del_node->rlink;
+        dict *succ_parent = del_node;
+        
+        while (successor->lbit == 1) {
+            succ_parent = successor;
+            successor = successor->llink;
+        }
+        
+        // �ƻs���~�`�I���ƾڨ�Q�R���`�I
+        strcpy(del_node->key, successor->key);
+        del_node->value = successor->value;
+        
+        // �������~�`�I
+        if (succ_parent == del_node) {
+            del_node->rlink = successor->rlink;
+            del_node->rbit = successor->rbit;
+        } else {
+            succ_parent->llink = successor->llink;
+            succ_parent->lbit = successor->lbit;
+        }
+        
+        free(successor);
+    }
+    
+    printf("�R��w[%s]����\n", key);
+}
+
+void find_newroot() {
+    struct dict *newroot_node, *prev;
+    
+    if(root->lbit == 0 && root->rbit == 0 ){
+    	printf("�R��w[%s]����\n", root->key);
+    	free(root);
+    	root = NULL;
+		return;
+	}
+    
+    if (root->lbit == 1) { // �����l��A�䥪�l�𤤳̤j���`�I
+        newroot_node = root->llink;
+        prev = root;
+        
+        // ��쥪�l�𤤳̤j���`�I
+        while (newroot_node->rbit == 1) {
+            prev = newroot_node;
+            newroot_node = newroot_node->rlink;
+        }
+        
+        // �B�z�s�ڸ`�I���s��
+        if (newroot_node != root->llink) {
+            // �p�G�s�ڤ��O��ڪ��������l�`�I
+            prev->rbit = newroot_node->rbit;  // �~�ӷs�ڪ��k��������A
+            prev->rlink = newroot_node->rlink; // �~�ӷs�ڪ��k�����
+            
+            newroot_node->lbit = root->lbit;  // �~�ӭ�ڪ������Ъ��A
+            newroot_node->llink = root->llink; // �~�ӭ�ڪ����l��
+            newroot_node->rbit = root->rbit;  // �~�ӭ�ڪ��k���Ъ��A
+            newroot_node->rlink = root->rlink; // �~�ӭ�ڪ��k�l��
+        } else {
+            // �p�G�s�ڬO��ڪ��������l�`�I
+            newroot_node->rbit = root->rbit;  // �~�ӭ�ڪ��k���Ъ��A
+            newroot_node->rlink = root->rlink; // �~�ӭ�ڪ��k�l��
+        }
+        
+    } else if (root->rbit == 1) { // ���k�l��A��k�l�𤤳̤p���`�I
+        newroot_node = root->rlink;
+        prev = root;
+        
+        // ���k�l�𤤳̤p���`�I
+        while (newroot_node->lbit == 1) {
+            prev = newroot_node;
+            newroot_node = newroot_node->llink;
+        }
+        
+        // �B�z�s�ڸ`�I���s��
+        if (newroot_node != root->rlink) {
+            // �p�G�s�ڤ��O��ڪ������k�l�`�I
+            prev->lbit = newroot_node->lbit;  // �~�ӷs�ڪ�����������A
+            prev->llink = newroot_node->llink; // �~�ӷs�ڪ��������
+            
+            newroot_node->lbit = root->lbit;  // �~�ӭ�ڪ������Ъ��A
+            newroot_node->llink = root->llink; // �~�ӭ�ڪ����l��
+            newroot_node->rbit = root->rbit;  // �~�ӭ�ڪ��k���Ъ��A
+            newroot_node->rlink = root->rlink; // �~�ӭ�ڪ��k�l��
+        } else {
+            // �p�G�s�ڬO��ڪ������k�l�`�I
+            newroot_node->lbit = root->lbit;  // �~�ӭ�ڪ������Ъ��A
+            newroot_node->llink = root->llink; // �~�ӭ�ڪ����l��
+        }
+    }
+    
+    // ��s�Y�`�I���s��
+    if(root != NULL){
+	    head->llink = newroot_node;
+	    printf("�R��w[%s]����\n", root->key);
+	    free(root);
+	    root = newroot_node;
+	}
+}
+
+void show(void) {
+    if (root == NULL) {
+        puts("�G���j�M��O�Ū�!");
+        return;
+    }
+    printf("�r���ܼƤ����x�s������(key�Gvalue)�p�U\n");
+    inorder(root);
+}
+
+// �ϥΤ޽u�S�ʶi�椤�ǹM��
+void inorder(dict *root) {
+    if (root == NULL) {
+        printf("�G���j�M��O�Ū�!\n");
+        return;
+    }
+
+    dict *current = root;
+    // ���̥��䪺�`�I
+    while (current->lbit == 1) {
+        current = current->llink;
+    }
+
+    // �ϥΤ޽u�S�ʹM��
+    while (current != head) {
+        printf("%s�G%d\n", current->key, current->value);
+        current = insuc(current);
+    }
+}
+
+// �M�䤤�ǫ��~�`�I
+dict *insuc(dict *ptr) {
+    dict *current;
+    
+    // �Y�k���ЬO������]rbit = 0�^�A������^�k����
+    if (ptr->rbit == 0) {
+        return ptr->rlink;
+    }
+    
+    // �_�h���k���@�B��A�@�������������F�̥��䪺�`�I
+    current = ptr->rlink;
+    while (current->lbit == 1) {
+        current = current->llink;
+    }
+    return current;
+}
+
+/* �j�Mtarget�Ҧb�`�I */
+struct dict *search(char target[]) {
+    struct dict *node = root;
+    
+    while (node != NULL && node != head) {  // �[�J head ���ˬd�H������Y�`�I
+        int cmp = strcmp(target, node->key);
+        if (cmp == 0) {
+            return node;  // ���ؼи`�I
+        } else if (cmp < 0) {  // target �p��ثe�`�I�A�����j�M
+            if (node->lbit == 0) {  // �p�G����O�����
+                return NULL;  // �N���䤣��ؼ�
+            }
+            node = node->llink;
+        } else {  // target �j��ثe�`�I�A���k�j�M
+            if (node->rbit == 0) {  // �p�G�k��O�����
+                return NULL;  // �N���䤣��ؼ�
+            }
+            node = node->rlink;
+        }
+    }
+    return NULL;  // �䤣��ؼ�
+}
+
+/* �j�Mnode�����`�I */
+struct dict *search_p(struct dict *node) {
+    if (node == NULL || node == root) {
+        return NULL;
+    }
+
+    struct dict *current = root;
+    struct dict *parent = NULL;
+
+    while (current != NULL && current != head) {
+        int cmp = strcmp(node->key, current->key);
+        
+        if (cmp == 0) {  // ���ؼи`�I�A��^����`�I
+            return parent;
+        }
+        
+        parent = current;  // ��s���`�I
+        
+        if (cmp < 0) {  // �ؼЦb���l��
+            if (current->lbit == 0) {  // �p�G�O�����
+                return NULL;  // �䤣��ؼ�
+            }
+            current = current->llink;
+        } else {  // �ؼЦb�k�l��
+            if (current->rbit == 0) {  // �p�G�O�����
+                return NULL;  // �䤣��ؼ�
+            }
+            current = current->rlink;
+        }
+    }
+    
+    return NULL;  // �S�����ؼи`�I
+}
+
+// ����Ҧ��`�I���D���j����
+void free_all_nodes(struct dict *root) {
+    if (root == NULL) {
+        return;
+    }
+
+    dict *current = root;
+    dict *temp;
+
+    // ���̥��䪺�`�I
+    while (current->lbit == 1) {
+        current = current->llink;
+    }
+
+    // �ϥΤ޽u�S�ʹM��������`�I
+    while (current != head) {
+        temp = current;
+        current = insuc(current);
+        printf("�R��'w[%s]=%d'�`�I\n", temp->key, temp->value);
+        free(temp);
+    }
+    root = NULL;
+}
diff --git a/作業/unit7/Threaded Binary Tree_bit.exe b/作業/unit7/Threaded Binary Tree_bit.exe
new file mode 100644
index 0000000..e3fd86e
Binary files /dev/null and b/作業/unit7/Threaded Binary Tree_bit.exe differ
diff --git a/作業/unit7/Threaded Binary Tree_stack.cpp b/作業/unit7/Threaded Binary Tree_stack.cpp
new file mode 100644
index 0000000..6d6836c
--- /dev/null
+++ b/作業/unit7/Threaded Binary Tree_stack.cpp	
@@ -0,0 +1,416 @@
+/*Notes: ��J�i�� 
+	w={"Mary":10, "Tom":3, "Charlie":5, "Bob":6, "Dickens":20, 4:9, "z":0, "Za":12, "aZ":8}
+	w={10:10, 20:3, 5:5, 17:6, 23:20, 18:9, 3:0, 9:12}
+	w={10:10, 5:5, 9:6, 3:20, 7:9}
+	w={"A":10, "B":3, "Charlie":5, "Bob":6, "Dickens":20}
+	w={"D":10, "C":3, "B":5, "A":6}
+	del w["A"]
+	del w["Dickens"]
+	del w["Mary"]
+	del w["aZ"]
+	del w 
+	w["Mary"]=1
+	w["Tom"]+=2
+	w[4]?
+	w?
+*/
+
+#include <stdio.h>	/* for sscanf(), printf() */
+#include <stdlib.h>	
+#include <string.h>	/* for strstr(), strtok(), strtok_r() */
+#include <conio.h> 
+#define MAX_STACK 100  // �w�q���|�j�p
+
+/* �w�qdict���c */
+typedef struct dict { 	/* �޽u�G���j�M��`�I����Ƶ��c�A��@�r�� */
+	 char key[20]; 		/* �����Ӹ`�I���u��v(key)���e */
+	 int value; 	/* �����u��v�������u�ȡv(value)���e */
+	 struct dict *llink; 	/* ���V���l��کΤ޽u�γ~ */
+	 struct dict *rlink; 	/* ���V�k�l��کΤ޽u�γ~ */
+	 int lbit; 		/* ���� llink �O�_�����`���� */
+	 int rbit; 		/* ���� rlink �O�_�����`���� */
+ } dict;
+
+// �w�q���|���c
+typedef struct {
+    dict* data[MAX_STACK];
+    int top;
+} Stack;
+
+void show(void);      /* ��X��� */
+void insert(char [], int);  /* �N��ƥ[�J�G���j�M�� */
+void removing(char []);  	/* �N��Ʊq�G���j�M�𤤲��� */
+void inorder(struct dict *);  /* ��ƥH���Ǫk��X */
+void free_all_nodes(struct dict *node);
+void find_newroot(void);  	/* �j�M�s�����`�I */
+
+dict *search_p(struct dict *node);
+dict *search(char []);  /* �j�M�`�I */
+
+dict *root = NULL, *ptr, *prev ,*head = NULL ;
+
+// ���|�ާ@���
+void initStack(Stack *s) {
+    s->top = -1;
+}
+
+int isEmpty(Stack *s) {
+    return s->top == -1;
+}
+
+int isFull(Stack *s) {
+    return s->top == MAX_STACK - 1;
+}
+
+void push(Stack *s, dict* node) {
+    if (!isFull(s)) {
+        s->data[++(s->top)] = node;
+    }
+}
+
+dict* pop(Stack *s) {
+    if (!isEmpty(s)) {
+        return s->data[(s->top)--];
+    }
+    return NULL;
+}
+
+void inorder(struct dict *root) {
+    if (root == NULL) {
+        return;
+    }
+
+    Stack stack;
+    initStack(&stack);
+    dict *current = root;
+
+    while (current != NULL || !isEmpty(&stack)) {
+        // �N�Ҧ����l�`�I���J���|
+        while (current != NULL) {
+            push(&stack, current);
+            current = current->llink;
+        }
+
+        // �q���|�����X�`�I�óB�z
+        current = pop(&stack);
+        if (current != NULL) {
+            printf("%s�G%d\n", current->key, current->value);
+            // ���ʨ�k�l�`�I
+            current = current->rlink;
+        }
+    }
+}
+
+// �D���j�覡����Ҧ��`�I
+void free_all_nodes(struct dict *root) {
+    if (root == NULL) {
+        return;
+    }
+
+    Stack stack;
+    initStack(&stack);
+    dict *current = root;
+    dict *last_processed = NULL;
+
+    while (current != NULL || !isEmpty(&stack)) {
+        if (current != NULL) {
+            push(&stack, current);
+            current = current->llink;
+        } else {
+            dict *peek = stack.data[stack.top];
+            
+            // �p�G�k�l�`�I�s�b�B�|���B�z
+            if (peek->rlink != NULL && last_processed != peek->rlink) {
+                current = peek->rlink;
+            } else {
+                peek = pop(&stack);
+                printf("�R��'w[%s]=%d'�`�I\n", peek->key, peek->value);
+                last_processed = peek;
+                free(peek);
+                current = NULL;
+            }
+        }
+    }
+}
+
+void show(void) {
+    if (root == NULL) {
+        puts("�G���j�M��O�Ū�!");
+        return;
+    }
+    printf("�r���ܼƤ����x�s������(key�Gvalue)�p�U\n");
+    inorder(root);
+}
+
+int main(){ 
+
+	head = (dict *)malloc(sizeof(dict));
+    if (head == NULL) {
+        printf("�O������t���ѡI\n");
+        return 1;
+    }
+	head->lbit = head->rbit = 1;
+	head->rlink = head;
+	head->llink = root;
+	
+	char  *token, key[12], line[128];
+	const char *s = " ={},";	/* ���j�ŰO���r�� */ 
+	int   value;
+	char  *rest ,option;
+	
+	
+   	printf("��J�s���r�媺���z�A�w��<Enter>�����{��\n");
+   	while (1) {
+   		printf("\n���O => ");
+   		fgets(line,128,stdin);		/* �ϥ�gets()Ū���]�i�H�A���]gets()���]Ū�J�r���ƪ�����A�i��ɭP�x�s��J�r�����}�C�Ŷ��z�� */ 
+   		if (line[0]=='\n') break;	/* ��J�Ŧr��h�������j�� */ 
+   		if (strstr(line,"{")) {		/* line�t��"{" */ 
+   			sscanf(line,"w = {%[^}]}",line);
+			rest = line;
+			while (token = strtok_r(rest,s,&rest)) { /* strtok_r()���Ϊk�i�Ѩ� http://bit.ly/3VcvbbZ */ 
+    			/* printf("%s\n",token); */ 
+    			if (strstr(token,":")) {/* token�t��":" */ 
+    				sscanf(token,"%[^:]:%d",key,&value);
+    				insert(key,value);
+//    				printf("Token #%d: ��=%s; ��=%d\n",++i,key,value);
+				} 
+   			}
+		}else if (strstr(line,"del")) {
+			if(sscanf(line,"del w[%[^]]]",key)){
+				if(strcmp(key,root->key)==0){
+//		        	printf("�R��������w[%s]��root�`�I\n",key);
+					find_newroot();
+//					printf("�s��root�`�I��w[%s]\n",root->key);
+				}else removing(key);
+			}else{
+				printf("�L�k�PŪ�N�R�����@�Ӥ����A�N�R����Ӧr��? (y/n) => ");
+				scanf("%c",&option);
+				fflush(stdin);
+				if (option == 'y' || option == 'Y') {
+					free_all_nodes(root);
+					root = NULL;
+				}else{
+		            printf("�����R���Ҧ��r��\n");
+		        }	
+			}
+		}else if (strstr(line,"+=")) {	/* line�t��"+=" */ 
+   			sscanf(line,"w[%[^]]] +=%d",key,&value);
+   			dict *modify_node;
+		   	if((modify_node = search(key)) == NULL){  /* �䤣���ƫh��ܿ��~ */
+		        printf("���~! %s ���b���G���j�M��!\n", key); 
+		    }else{
+		    	modify_node->value += value;
+				printf("�s�]w[%s]=%d\n",key,modify_node->value);
+			}
+		}else if (strstr(line,"=")) {	/* line�t��"=" */
+   			sscanf(line,"w[%[^]]] = %d",key,&value);
+   			dict *add_node;
+   			if (root == NULL){
+			   insert(key,value);
+			   printf("�s�]w[%s]=%d\n",key,root->value);
+			}else{
+				if((add_node = search(key)) == NULL){  /* �䤣���ƫh�s�W��� */
+			   		insert(key,value);
+			        printf("%s ���b���G���j�M��!\n", key); 
+			        printf("�s�]w[%s]=%d\n",key,value);
+			    }else{
+			    	add_node->value = value;
+			    	printf("�s�]w[%s]=%d\n",key,add_node->value);
+				}
+			} 
+		}else if (sscanf(line,"w[%[^]]]?",key)==1){
+			dict *read_node; 
+		   	if((read_node = search(key)) == NULL){  /* �䤣���ƫh�s�W��� */
+		        printf("���~! %s ���b���G���j�M��!\n", key); 
+		    }else{
+		    	printf("�r�夸��w[%s]=%d\n",key,read_node->value);
+			}
+		}else if (strstr(line,"?")) show();
+		else printf("�y�k�L�k��{�Asorry!\n");
+	}
+	printf("\n�{�������A�R���Ҧ��`�I�Abye ~\n");
+	free_all_nodes(root);
+   	free(head);
+   	
+   	return 0;
+}
+
+/* �B�z�G���j�M��A�N�s�W��ƥ[�J�ܤG���j�M�� */
+void insert(char key[], int value){
+    struct dict *node, *prev;
+    /* ��Ƥw�s�b�h��ܿ��~ */
+    if (search(key) != NULL) {
+        printf("%s �w�s�b!\n", key);
+        return;
+    }
+    ptr = (struct dict *) malloc(sizeof(struct dict));
+    strcpy(ptr->key, key);
+    ptr->value = value;
+    ptr->llink = ptr->rlink = NULL;
+    ptr->lbit = ptr->rbit = 0;
+    if (root == NULL){/* ���ڸ`�I��NULL�����p */
+        root = ptr;
+        ptr->lbit = ptr->rbit = 1;
+	}else{ /* ���ڸ`�I����NULL�����p */
+        node = root;
+        while (node != NULL) { /* �j�M��ƴ��J�I */
+            prev = node;
+            if(strcmp(ptr->key, node->key) < 0)
+                node = node->llink;
+            else
+                node = node->rlink;
+        }
+        if (strcmp(ptr->key, prev->key) < 0){
+        	prev->llink = ptr;
+        	prev->lbit = 1;
+		}else{
+			prev->rlink = ptr;
+			prev->rbit = 1;
+		}
+    }
+}
+
+/* �N��Ʊq�G���j�M�𤤲��� */
+void removing(char key[]){
+    dict *del_node = search(key);
+    if (del_node == NULL) {
+        printf("%s ���b���G���j�M��!\n", key);
+        return;
+    }
+    
+    dict *parent = search_p(del_node);
+    
+    // �B�z�S���l�`�I�����p
+    if (del_node->llink == NULL && del_node->rlink == NULL) {
+        if (parent == NULL) {  // �R�����O�ڸ`�I
+            root = NULL;
+        } else if (parent->llink == del_node) {
+            parent->llink = NULL;
+        } else {
+            parent->rlink = NULL;
+        }
+    }else if (del_node->llink == NULL || del_node->rlink == NULL) {  // �B�z�@�䦳�l�`�I�����p
+        dict *child = (del_node->llink != NULL) ? del_node->llink : del_node->rlink;
+        
+        if (parent == NULL) {  //�R�����O�ڸ`�I
+            root = child;
+        } else if (parent->llink == del_node) {
+            parent->llink = child;
+        } else {
+            parent->rlink = child;
+        }
+    }else{ //�B�z���䦳�l�`�I�����p
+    	if(del_node == parent->rlink){
+    		parent->rlink = del_node->llink;
+    		if(del_node->llink->rlink != NULL){ //�Y�R�����`�I���l�`�I�٦��k�`�I�����p
+    			dict *child = del_node->llink->rlink;
+    			printf("%s\n",child->key);
+    			while(child->rlink!= NULL){ //��k�`�I����̩� 
+    				child = child->rlink;
+    				printf("%s\n",child->key);
+				}
+				child->rlink = del_node->rlink;
+			}else parent->rlink->rlink = del_node->rlink;  //�S���h��������
+    		
+		}else{
+			parent->llink = del_node->llink;
+			if(del_node->rlink->llink != NULL){ //�Y�R�����`�I���l�`�I�٦����`�I�����p 
+    			dict *child = del_node->rlink->llink;
+    			printf("%s\n",child->key);
+    			while(child->llink!= NULL){ //�䥪�`�I����̩� 
+    				child = child->llink;
+    				printf("%s\n",child->key);
+				}
+				child->llink = del_node->llink;
+			}else parent->llink->rlink = del_node->rlink; //�S���h��������
+		}  
+	}
+    free(del_node);  /* ����O���� */
+	printf("�R��w[%s]����\n",key);
+}
+
+void find_newroot(){ /* �j�M�s�����`�I ���s���̤j��*/
+	struct dict *newroot_node ,*prev;
+	
+	if(root->llink!=NULL){ //�䥪�s�����̤j��  
+		newroot_node = root->llink;
+		
+		while(newroot_node->rlink!=NULL){ //��ڪ����N�`�I 
+			prev = newroot_node;
+			newroot_node = newroot_node->rlink;
+		}
+		if(newroot_node->llink!=NULL){ //�Y�s���ڸ`�I�����`�I 
+			prev->rlink = newroot_node->llink;
+		}else prev->rlink = NULL;
+		
+		if(newroot_node != root->llink ){  //�Y�s���ڸ`�I������쥻�ڪ����`�I
+			newroot_node->llink = root->llink;
+			newroot_node->rlink = root->rlink;
+		}else{	//�Y�s���ڸ`�I����쥻�ڪ����`�I
+			newroot_node->rlink = root->rlink;
+		}
+		printf("�R��w[%s]����\n",root->key);
+		free(root);
+		root = newroot_node;
+	}else if(root->rlink!=NULL){ //��k�s�����̤p��  
+		newroot_node = root->rlink;
+		
+		while(newroot_node->llink!=NULL){ //��ڪ����N�`�I 
+			prev = newroot_node;
+			newroot_node = newroot_node->llink;
+		}
+		if(newroot_node->rlink!=NULL){ //�Y�s���ڸ`�I���k�`�I  
+			prev->llink = newroot_node->rlink;
+		}else prev->llink = NULL;
+		
+		if(newroot_node != root->rlink ){ //�Y�s���ڸ`�I������쥻�ڪ��k�`�I
+			newroot_node->llink = root->llink;
+			newroot_node->rlink = root->rlink;
+		}else{ //�Y�s���ڸ`�I����쥻�ڪ��k�`�I 
+			newroot_node->llink = root->llink;
+		}
+		printf("�R��w[%s]����\n",root->key);
+		free(root);
+		root = newroot_node;
+	}
+	
+}
+
+/* �j�Mtarget�Ҧb�`�I */
+struct dict *search(char target[]){
+    struct dict *node;
+    node = root;
+    while(node != NULL)
+    {
+        if (strcmp(target, node->key) == 0)
+            return node;
+        else
+            /* target�p��ثe�`�I�A�����j�M */
+            if (strcmp(target, node->key) < 0)
+                node = node->llink;
+            else  /* target�j��ثe�`�I�A���k�j�M */
+                node = node->rlink;
+    }
+    return node;
+}
+
+/* �j�Mnode�����`�I */
+struct dict *search_p(struct dict *node){
+    struct dict *parent;
+    parent = root;
+    while (parent != NULL) {
+        if (strcmp(node->key, parent->key) < 0) {
+            if (strcmp(node->key, parent->llink->key) == 0)
+                return parent;
+            else
+                parent = parent->llink;
+        }
+        else {
+            if (strcmp(node->key, parent->rlink->key) == 0)
+                return parent;
+            else
+                parent = parent->rlink;
+        }
+    }
+    return NULL;
+}
diff --git a/作業/unit7/binarySearchTree.c b/作業/unit7/binarySearchTree.c
new file mode 100644
index 0000000..28e7392
--- /dev/null
+++ b/作業/unit7/binarySearchTree.c
@@ -0,0 +1,307 @@
+/* file name: binarySearchTree.c */
+/* �Q�ΤG���j�M��B�z��ơи��J�B�x�s�B�s�W�B�R���B�ק�B��X */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+/* �w�qstudent���c */
+struct student {
+    char name[20];  /* �ǥͩm�W */
+    int score;  /* �ǥͦ��Z */
+    struct student *llink;  /* ���l�쵲 */
+    struct student *rlink;  /* �k�l�쵲 */
+};
+
+
+void insert_f(void);    /* �s�W��� */
+void delete_f(void);    /* �R����� */
+void modify_f(void);    /* �ק��� */
+void show_f(void);      /* ��X��� */
+void process(char [], int);  /* �N��ƥ[�J�G���j�M�� */
+void removing(char []);  /* �N��Ʊq�G���j�M�𤤲��� */
+struct student *replace(struct student *);  /* �M����N�`�I */
+void connecting(struct student *, char);  /* �վ��쵲 */
+void inorder(struct student *);  /* ��ƥH���Ǫk��X */
+void flushBuffer(void);
+
+struct student *search(char []);  /* �j�M�`�I */
+struct student *search_re_r(struct student *);  /* �j�M�k�l����N�`�I */
+struct student *search_re_l(struct student *);  /* �j�M���l����N�`�I */
+struct student *search_p(struct student *);  /* �j�M���`�I */
+
+struct student *root, *ptr;
+int main(void)
+{
+    char option;
+
+    while(1) {
+        puts("");
+        puts("********************");
+        puts("     <1> insert");
+        puts("     <2> delete");
+        puts("     <3> modify");
+        puts("     <4> show");
+        puts("     <5> quit");
+        puts("********************");
+        printf("Enter your choice: ");
+        option = getchar();
+        flushBuffer();
+        printf("\n");
+        switch(option) {
+            case '1':
+                insert_f();
+                break;
+            case '2':
+                delete_f();
+                break;
+            case '3':
+                modify_f();
+                break;
+            case '4':
+                show_f();
+                break;
+            case '5':
+                exit(0);
+            default :
+                puts("�ﶵ���~!");
+        }
+    }
+    return 0;
+}
+
+/* �s�W��ơA�s�W�@���s����� */
+void insert_f(void)
+{
+    char name[20];
+    int score;
+    puts("=====INSERT DATA=====");
+    printf("�m�W: ");
+    scanf("%s", name);
+    printf("����: ");
+    scanf("%d", &score);
+    flushBuffer();
+    process(name, score);
+}
+
+/* �R����ơA�N��Ʊq�G���j�M�𤤧R�� */
+void delete_f(void)
+{
+    char name[20];
+    if (root == NULL) {
+        puts("�G���j�M��O�Ū�!");
+        return;
+    }
+    puts("=====DELETE DATA=====");
+    printf("�п�J���R�����m�W: ");
+    scanf("%s", name);
+    flushBuffer();
+    removing(name);
+}
+
+/* �ק��ơA�ק�ǥͦ��Z */
+void modify_f(void)
+{
+    struct student *node;
+    char name[20];
+    
+    /* �P�_�ڸ`�I�O�_��NULL */
+    if (root == NULL) {
+        puts("�G���j�M��O�Ū�!");
+        return;
+    }
+    puts("=====MODIFY DATA===== ");
+    printf("�п�J���ק諸�m�W: ");
+    scanf("%s", name);
+    flushBuffer();
+    if ((node = search(name)) == NULL)
+        printf("%s ���b�G���j�M��!\n", name);
+    else {
+        /* �C�X���ƪ��p */
+        printf("�m�W: %s\n", node->name);
+        printf("����: %d\n\n", node->score);
+        printf("�п�J�s������: ");
+        scanf("%d", &node->score);
+        flushBuffer();
+        printf("%s �w�Q�ק�\n", name);
+    }
+}
+
+/* ��X��ơA�N��ƿ�X�ܿù� */
+void show_f(void)
+{
+    /* �P�_�ڸ`�I�O�_��NULL */
+    if (root == NULL) {
+        puts("�G���j�M��O�Ū�!");
+        return;
+    }
+    puts("=====SHOW DATA=====");
+    inorder(root);  /* �H���Ǫk��X��� */
+}
+
+/* �B�z�G���j�M��A�N�s�W��ƥ[�J�ܤG���j�M�� */
+void process(char name[], int score)
+{
+    struct student *node, *prev;
+    /* ��Ƥw�s�b�h��ܿ��~ */
+    if (search(name) != NULL) {
+        printf("%s �w�s�b!\n", name);
+        return;
+    }
+    ptr = (struct student *) malloc(sizeof(struct student));
+    strcpy(ptr->name, name);
+    ptr->score = score;
+    ptr->llink = ptr->rlink = NULL;
+    if (root == NULL)  /* ���ڸ`�I��NULL�����p */
+        root = ptr;
+    else { /* ���ڸ`�I����NULL�����p */
+        node = root;
+        while (node != NULL) { /* �j�M��ƴ��J�I */
+            prev = node;
+            if(score > node->score)
+                node = node->rlink;
+            else
+                node = node->llink;
+        }
+        if (score < prev->score)
+            prev->llink = ptr;
+        else
+            prev->rlink = ptr;
+    }
+}
+
+/* �N��Ʊq�G���j�M�𤤲��� */
+void removing(char name[])
+{
+    struct student *del_node;
+    if((del_node = search(name)) == NULL)  /* �䤣���ƫh��ܿ��~ */
+    {
+        printf("%s ���b���G���j�M��!\n", name);
+        return;
+    }
+    /* �`�I�����𸭸`�I�����p */
+    if (del_node->llink != NULL || del_node->rlink != NULL)
+        del_node = replace(del_node);
+    else  /* �`�I���𸭸`�I�����p */
+        if(del_node == root)
+            root = NULL;
+        else
+            connecting(del_node, 'n');
+    free(del_node);  /* ����O���� */
+    printf("%s �w�Q�R��!\n", name);
+}
+
+/* �M��R���D�𸭸`�I�����N�`�I */
+struct student *replace(struct student *node)
+{
+    struct student *re_node;
+    /* ���k�l��䤣����N�`�I�A�|�j�M���l��O�_�s�b���N�`�I */
+    if ((re_node = search_re_r(node->rlink)) == NULL)
+        re_node = search_re_l(node->llink);
+    if (re_node->rlink != NULL)  /* �����N�`�I���k�l��s�b�����p */
+        connecting(re_node, 'r');
+    else
+        if (re_node->llink != NULL)  /* �����N�`�I�����l��s�b�����p */
+            connecting(re_node, 'l');
+        else  /* �����N�`�I���𸭸`�I�����p */
+            connecting(re_node, 'n');
+    strcpy(node->name, re_node->name);
+    node->score = re_node->score;
+    return re_node;
+}
+
+/* �վ�G���j�M���쵲�Alink �� r ���ܳB�z�k�쵲�A�� l ���B�z���쵲�A
+   �� m �h�N�쵲���V NULL */
+void connecting(struct student *node, char link)
+{
+    struct student *parent;
+    parent = search_p(node);  /* �j�M���`�I */
+    /* �`�I�����`�I���l�𪺪��p */
+    if (node->score > parent->score)
+        if(link == 'r')  /* link��r */
+            parent->rlink = node->rlink;
+        else  /* link��m */
+            parent->rlink = NULL;
+    else  /* �`�I�����`�I�k�l�𪺪��p */
+        if (link == 'l')  /* link��l */
+            parent->llink = node->llink;
+        else  /* link��m */
+            parent->llink = NULL;
+}
+
+/* �H���Ǫk��X��ơA�Ļ��j�覡 */
+void inorder(struct student *node)
+{
+    if(node != NULL) {
+        inorder(node->llink);
+        printf("%-10s %d\n", node->name, node->score);
+        inorder(node->rlink);
+    }
+}
+
+/* �j�Mtarget�Ҧb�`�I */
+struct student *search(char target[])
+{
+    struct student *node;
+    node = root;
+    while(node != NULL)
+    {
+        if (strcmp(target, node->name) == 0)
+            return node;
+        else
+            /* target�p��ثe�`�I�A�����j�M */
+            if (strcmp(target, node->name) < 0)
+                node = node->llink;
+            else  /* target�j��ثe�`�I�A���k�j�M */
+                node = node->rlink;
+    }
+    return node;
+}
+
+/* �j�M�k�l����N�`�I */
+struct student *search_re_r(struct student *node)
+{
+    struct student *re_node;
+    re_node = node;
+    while (re_node != NULL && re_node->llink != NULL)
+        re_node = re_node->llink;
+    return re_node;
+}
+
+/* �j�M���l����N�`�I */
+struct student *search_re_l(struct student *node)
+{
+    struct student *re_node;
+    re_node = node;
+    while (re_node != NULL && re_node->rlink != NULL)
+        re_node = re_node->rlink;
+    return re_node;
+}
+
+/* �j�Mnode�����`�I */
+struct student *search_p(struct student *node)
+{
+    struct student *parent;
+    parent = root;
+    while (parent != NULL) {
+        if (node->score > parent->score) {
+            if (parent->rlink == node)
+                return parent;
+            else
+                parent = parent->rlink;
+        }
+        else {
+            if (parent->llink == node)
+                return parent;
+            else
+                parent = parent->llink;
+        }
+    }
+    return NULL;
+}
+
+void flushBuffer()
+{
+    while (getchar() != '\n')
+        continue;
+}
diff --git a/作業/unit7/binarySearchTree.exe b/作業/unit7/binarySearchTree.exe
new file mode 100644
index 0000000..ea8c5f1
Binary files /dev/null and b/作業/unit7/binarySearchTree.exe differ
diff --git a/作業/unit7/binarySearchTree_byname.c b/作業/unit7/binarySearchTree_byname.c
new file mode 100644
index 0000000..6fe522f
--- /dev/null
+++ b/作業/unit7/binarySearchTree_byname.c
@@ -0,0 +1,307 @@
+/* file name: binarySearchTree.c */
+/* �Q�ΤG���j�M��B�z��ơи��J�B�x�s�B�s�W�B�R���B�ק�B��X */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+/* �w�qstudent���c */
+struct student {
+    char name[20];  /* �ǥͩm�W */
+    int score;  /* �ǥͦ��Z */
+    struct student *llink;  /* ���l�쵲 */
+    struct student *rlink;  /* �k�l�쵲 */
+};
+
+
+void insert_f(void);    /* �s�W��� */
+void delete_f(void);    /* �R����� */
+void modify_f(void);    /* �ק��� */
+void show_f(void);      /* ��X��� */
+void process(char [], int);  /* �N��ƥ[�J�G���j�M�� */
+void removing(char []);  /* �N��Ʊq�G���j�M�𤤲��� */
+struct student *replace(struct student *);  /* �M����N�`�I */
+void connecting(struct student *, char);  /* �վ��쵲 */
+void inorder(struct student *);  /* ��ƥH���Ǫk��X */
+void flushBuffer(void);
+
+struct student *search(char []);  /* �j�M�`�I */
+struct student *search_re_r(struct student *);  /* �j�M�k�l����N�`�I */
+struct student *search_re_l(struct student *);  /* �j�M���l����N�`�I */
+struct student *search_p(struct student *);  /* �j�M���`�I */
+
+struct student *root, *ptr;
+int main(void)
+{
+    char option;
+
+    while(1) {
+        puts("");
+        puts("********************");
+        puts("     <1> insert");
+        puts("     <2> delete");
+        puts("     <3> modify");
+        puts("     <4> show");
+        puts("     <5> quit");
+        puts("********************");
+        printf("Enter your choice: ");
+        option = getchar();
+        flushBuffer();
+        printf("\n");
+        switch(option) {
+            case '1':
+                insert_f();
+                break;
+            case '2':
+                delete_f();
+                break;
+            case '3':
+                modify_f();
+                break;
+            case '4':
+                show_f();
+                break;
+            case '5':
+                exit(0);
+            default :
+                puts("�ﶵ���~!");
+        }
+    }
+    return 0;
+}
+
+/* �s�W��ơA�s�W�@���s����� */
+void insert_f(void)
+{
+    char name[20];
+    int score;
+    puts("=====INSERT DATA=====");
+    printf("�m�W: ");
+    scanf("%s", name);
+    printf("����: ");
+    scanf("%d", &score);
+    flushBuffer();
+    process(name, score);
+}
+
+/* �R����ơA�N��Ʊq�G���j�M�𤤧R�� */
+void delete_f(void)
+{
+    char name[20];
+    if (root == NULL) {
+        puts("�G���j�M��O�Ū�!");
+        return;
+    }
+    puts("=====DELETE DATA=====");
+    printf("�п�J���R�����m�W: ");
+    scanf("%s", name);
+    flushBuffer();
+    removing(name);
+}
+
+/* �ק��ơA�ק�ǥͦ��Z */
+void modify_f(void)
+{
+    struct student *node;
+    char name[20];
+    
+    /* �P�_�ڸ`�I�O�_��NULL */
+    if (root == NULL) {
+        puts("�G���j�M��O�Ū�!");
+        return;
+    }
+    puts("=====MODIFY DATA===== ");
+    printf("�п�J���ק諸�m�W: ");
+    scanf("%s", name);
+    flushBuffer();
+    if ((node = search(name)) == NULL)
+        printf("%s ���b�G���j�M��!\n", name);
+    else {
+        /* �C�X���ƪ��p */
+        printf("�m�W: %s\n", node->name);
+        printf("����: %d\n\n", node->score);
+        printf("�п�J�s������: ");
+        scanf("%d", &node->score);
+        flushBuffer();
+        printf("%s �w�Q�ק�\n", name);
+    }
+}
+
+/* ��X��ơA�N��ƿ�X�ܿù� */
+void show_f(void)
+{
+    /* �P�_�ڸ`�I�O�_��NULL */
+    if (root == NULL) {
+        puts("�G���j�M��O�Ū�!");
+        return;
+    }
+    puts("=====SHOW DATA=====");
+    inorder(root);  /* �H���Ǫk��X��� */
+}
+
+/* �B�z�G���j�M��A�N�s�W��ƥ[�J�ܤG���j�M�� */
+void process(char name[], int score)
+{
+    struct student *node, *prev;
+    /* ��Ƥw�s�b�h��ܿ��~ */
+    if (search(name) != NULL) {
+        printf("%s �w�s�b!\n", name);
+        return;
+    }
+    ptr = (struct student *) malloc(sizeof(struct student));
+    strcpy(ptr->name, name);
+    ptr->score = score;
+    ptr->llink = ptr->rlink = NULL;
+    if (root == NULL)  /* ���ڸ`�I��NULL�����p */
+        root = ptr;
+    else { /* ���ڸ`�I����NULL�����p */
+        node = root;
+        while (node != NULL) { /* �j�M��ƴ��J�I */
+            prev = node;
+            if(strcmp(ptr->name, node->name) < 0)
+                node = node->llink;
+            else
+                node = node->rlink;
+        }
+        if (strcmp(ptr->name, prev->name) < 0)
+            prev->llink = ptr;
+        else
+            prev->rlink = ptr;
+    }
+}
+
+/* �N��Ʊq�G���j�M�𤤲��� */
+void removing(char name[])
+{
+    struct student *del_node;
+    if((del_node = search(name)) == NULL)  /* �䤣���ƫh��ܿ��~ */
+    {
+        printf("%s ���b���G���j�M��!\n", name);
+        return;
+    }
+    /* �`�I�����𸭸`�I�����p */
+    if (del_node->llink != NULL || del_node->rlink != NULL)
+        del_node = replace(del_node);
+    else  /* �`�I���𸭸`�I�����p */
+        if(del_node == root)
+            root = NULL;
+        else
+            connecting(del_node, 'n');
+    free(del_node);  /* ����O���� */
+    printf("%s �w�Q�R��!\n", name);
+}
+
+/* �M��R���D�𸭸`�I�����N�`�I */
+struct student *replace(struct student *node)
+{
+    struct student *re_node;
+    /* ���k�l��䤣����N�`�I�A�|�j�M���l��O�_�s�b���N�`�I */
+    if ((re_node = search_re_r(node->rlink)) == NULL)
+        re_node = search_re_l(node->llink);
+    if (re_node->rlink != NULL)  /* �����N�`�I���k�l��s�b�����p */
+        connecting(re_node, 'r');
+    else
+        if (re_node->llink != NULL)  /* �����N�`�I�����l��s�b�����p */
+            connecting(re_node, 'l');
+        else  /* �����N�`�I���𸭸`�I�����p */
+            connecting(re_node, 'n');
+    strcpy(node->name, re_node->name);
+    node->score = re_node->score;
+    return re_node;
+}
+
+/* �վ�G���j�M���쵲�Alink �� r ���ܳB�z�k�쵲�A�� l ���B�z���쵲�A
+   �� m �h�N�쵲���V NULL */
+void connecting(struct student *node, char link)
+{
+    struct student *parent;
+    parent = search_p(node);  /* �j�M���`�I */
+    /* �`�I�����`�I���l�𪺪��p */
+    if (strcmp(node->name, parent->name) < 0)
+        if(link == 'r')  /* link��r */
+            parent->llink = node->rlink;
+        else  /* link��m */
+            parent->llink = NULL;
+    else  /* �`�I�����`�I�k�l�𪺪��p */
+        if (link == 'l')  /* link��l */
+            parent->rlink = node->llink;
+        else  /* link��m */
+            parent->rlink = NULL;
+}
+
+/* �H���Ǫk��X��ơA�Ļ��j�覡 */
+void inorder(struct student *node)
+{
+    if(node != NULL) {
+        inorder(node->llink);
+        printf("%-10s %d\n", node->name, node->score);
+        inorder(node->rlink);
+    }
+}
+
+/* �j�Mtarget�Ҧb�`�I */
+struct student *search(char target[])
+{
+    struct student *node;
+    node = root;
+    while(node != NULL)
+    {
+        if (strcmp(target, node->name) == 0)
+            return node;
+        else
+            /* target�p��ثe�`�I�A�����j�M */
+            if (strcmp(target, node->name) < 0)
+                node = node->llink;
+            else  /* target�j��ثe�`�I�A���k�j�M */
+                node = node->rlink;
+    }
+    return node;
+}
+
+/* �j�M�k�l����N�`�I */
+struct student *search_re_r(struct student *node)
+{
+    struct student *re_node;
+    re_node = node;
+    while (re_node != NULL && re_node->llink != NULL)
+        re_node = re_node->llink;
+    return re_node;
+}
+
+/* �j�M���l����N�`�I */
+struct student *search_re_l(struct student *node)
+{
+    struct student *re_node;
+    re_node = node;
+    while (re_node != NULL && re_node->rlink != NULL)
+        re_node = re_node->rlink;
+    return re_node;
+}
+
+/* �j�Mnode�����`�I */
+struct student *search_p(struct student *node)
+{
+    struct student *parent;
+    parent = root;
+    while (parent != NULL) {
+        if (strcmp(node->name, parent->name) < 0) {
+            if (strcmp(node->name, parent->llink->name) == 0)
+                return parent;
+            else
+                parent = parent->llink;
+        }
+        else {
+            if (strcmp(node->name, parent->rlink->name) == 0)
+                return parent;
+            else
+                parent = parent->rlink;
+        }
+    }
+    return NULL;
+}
+
+void flushBuffer()
+{
+    while (getchar() != '\n')
+        continue;
+}
diff --git a/作業/unit7/binarySearchTree_byname.exe b/作業/unit7/binarySearchTree_byname.exe
new file mode 100644
index 0000000..efc5438
Binary files /dev/null and b/作業/unit7/binarySearchTree_byname.exe differ
diff --git a/作業/unit7/tokenization.c b/作業/unit7/tokenization.c
new file mode 100644
index 0000000..eb2d7be
--- /dev/null
+++ b/作業/unit7/tokenization.c
@@ -0,0 +1,62 @@
+/*
+Program: tokenization.c (Report comments/bugs to chikh@yuntech.edu.tw)
+Function: ��J�B���������r��A�q�����������T�A���@�~���w�Ʒx�� 
+Notes: ��J�i�� 
+	w={"Mary":10, "Tom":3, "Charlie":5, "Bob":6, "Dickens":20, 4:9, "z":0, "Za":12, "aZ":8}
+	del w["Dickens"]
+	w["Mary"]=1
+	w["Tom"]+=2
+	w[4]?
+	w?
+*/
+ 
+#include <stdio.h>	/* for sscanf(), printf() */
+#include <string.h>	/* for strstr(), strtok(), strtok_r() */
+
+int main()
+{ 
+	char  *token, key[12], line[128];
+	const char *s = " ={},";	/* ���j�ŰO���r�� */ 
+	int   value, i = 0;
+	char  *rest;
+   	
+   	printf("\n*** �q�r��Ū���ŰO(token)�{�� ***\n\n��J�s���r�媺���z�A�w��<Enter>�����{��\n");
+   	while (1) {
+   		printf("\n���O => ");
+   		fgets(line,128,stdin);		/* �ϥ�gets()Ū���]�i�H�A���]gets()���]Ū�J�r���ƪ�����A�i��ɭP�x�s��J�r�����}�C�Ŷ��z�� */ 
+   		if (line[0]=='\n') break;	/* ��J�Ŧr��h�������j�� */ 
+   		if (strstr(line,"{")) {		/* line�t��"{" */ 
+   			sscanf(line,"w = {%[^}]}",line);
+   			/* printf("�j�A�����r�� %s\n",line); */
+			rest = line;
+			while (token = strtok_r(rest,s,&rest)) { /* strtok_r()���Ϊk�i�Ѩ� http://bit.ly/3VcvbbZ */ 
+    			/* printf("%s\n",token); */ 
+    			if (strstr(token,":")) {/* token�t��":" */ 
+    				sscanf(token,"%[^:]:%d",key,&value);
+    				printf("Token #%d: ��=%s; ��=%d\n",++i,key,value);
+				} 
+   			}
+		}
+		else if (strstr(line,"del")) {	/* line�t��"del" */ 
+			sscanf(line,"del w[%[^]]]",key);
+   			printf("�R���B��G��=%s\n",key);
+		}
+   		else if (strstr(line,"+=")) {	/* line�t��"+=" */ 
+   			sscanf(line,"w[%[^]]] +=%d",key,&value);
+   			printf("���W�B��G��=%s�F�B�⤸=%d\n",key,value);
+		}
+   		else if (strstr(line,"=")) {	/* line�t��"=" */
+   			sscanf(line,"w[%[^]]] = %d",key,&value);
+   			printf("�����B��G��=%s; �B�⤸=%d\n",key,value);
+		}
+		else if (sscanf(line,"w[%[^]]]?",key)==1) 
+			printf("Ū�ȹB��G��=%s\n",key);
+		else if (strstr(line,"?"))
+			printf("��ܾ�Ӧr�夺�e(�ЦP�ǹ�@�A�����@�~���@����)\n");
+		else 
+			printf("�y�k�L�k��{�Asorry!\n");
+	}
+   	
+   	printf("\n�{�������Abye ~\n");
+   	return 0;
+}
diff --git a/作業/unit7/try.cpp b/作業/unit7/try.cpp
new file mode 100644
index 0000000..6657346
--- /dev/null
+++ b/作業/unit7/try.cpp
@@ -0,0 +1,203 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <conio.h>
+
+/* �w�q�޽u�G���j�M�𵲺c */
+typedef struct student {
+    char name[20];      /* �ǥͩm�W */
+    int score;          /* �ǥͦ��Z */
+    struct student *left;   /* ���l���� */
+    struct student *right;  /* �k�l���� */
+    int leftThread;     /* ���u���аO */
+    int rightThread;    /* �k�u���аO */
+} student;
+
+/* �����ܼ� */
+student *root = NULL;
+student *head = NULL;
+
+/* ��ƭ쫬 */
+void insert(char [], int);
+void remove_node(char []);
+void show_tree();
+student *search(char []);
+student *find_inorder_successor(student *);
+student *find_inorder_predecessor(student *);
+void free_tree(student *);
+
+/* ��M���ǫ��~�`�I */
+student *find_inorder_successor(student *node) {
+    if (node->rightThread)
+        return node->right;
+
+    node = node->right;
+    while (!node->leftThread)
+        node = node->left;
+    return node;
+}
+
+/* ��M���ǫe�X�`�I */
+student *find_inorder_predecessor(student *node) {
+    if (node->leftThread)
+        return node->left;
+
+    node = node->left;
+    while (!node->rightThread)
+        node = node->right;
+    return node;
+}
+
+/* ���J�`�I */
+void insert(char name[], int score) {
+    student *new_node, *current, *parent;
+
+    /* �ˬd�`�I�O�_�w�s�b */
+    if (search(name) != NULL) {
+        printf("%s �w�s�b!\n", name);
+        return;
+    }
+
+    new_node = (student *)malloc(sizeof(student));
+    strcpy(new_node->name, name);
+    new_node->score = score;
+    new_node->leftThread = new_node->rightThread = 1;
+
+    if (root == NULL) {
+        /* �إߪ��Y�`�I */
+        head = (student *)malloc(sizeof(student));
+        head->leftThread = head->rightThread = 0;
+        head->right = head;
+        head->left = new_node;
+
+        /* �Ĥ@�Ӹ`�I */
+        new_node->left = head;
+        new_node->right = head;
+        root = new_node;
+        return;
+    }
+
+    current = root;
+    while (1) {
+        parent = current;
+        if (strcmp(name, current->name) < 0) {
+            if (current->leftThread)
+                break;
+            current = current->left;
+        } else {
+            if (current->rightThread)
+                break;
+            current = current->right;
+        }
+    }
+
+    if (strcmp(name, parent->name) < 0) {
+        /* ���l�`�I */
+        new_node->left = parent->left;
+        new_node->right = parent;
+        parent->left = new_node;
+        parent->leftThread = 0;
+    } else {
+        /* �k�l�`�I */
+        new_node->right = parent->right;
+        new_node->left = parent;
+        parent->right = new_node;
+        parent->rightThread = 0;
+    }
+}
+
+/* ���ǹM�� */
+void show_tree() {
+    student *current;
+
+    if (root == NULL) {
+        printf("��O�Ū�!\n");
+        return;
+    }
+
+    current = root;
+    while (!current->leftThread)
+        current = current->left;
+
+    printf("�r���ܼƤ����x�s������(key�Gvalue)�p�U\n");
+    while (current != head) {
+        printf("%s�G%d\n", current->name, current->score);
+        current = find_inorder_successor(current);
+    }
+}
+
+/* �j�M�`�I */
+student *search(char target[]) {
+    student *current = root;
+
+    while (current != NULL) {
+        if (strcmp(target, current->name) == 0)
+            return current;
+        
+        if (strcmp(target, current->name) < 0) {
+            if (current->leftThread)
+                break;
+            current = current->left;
+        } else {
+            if (current->rightThread)
+                break;
+            current = current->right;
+        }
+    }
+    return NULL;
+}
+
+/* �R���`�I */
+void remove_node(char name[]) {
+    student *node = search(name);
+    if (node == NULL) {
+        printf("%s ���b��!\n", name);
+        return;
+    }
+
+    // �R���`�I����@���������A�o�̷|����h�Ӹ`�ݭn�B�z
+    printf("�R���`�I����@�b�޽u�G���j�M�𤤸��������A�ݭn�S�O�B�z�u���C\n");
+}
+
+/* ����𪺰O���� */
+void free_tree(student *node) {
+    if (node == NULL) return;
+
+    if (!node->leftThread)
+        free_tree(node->left);
+    if (!node->rightThread)
+        free_tree(node->right);
+
+    printf("�R��'w[%s]=%d'�`�I\n", node->name, node->score);
+    free(node);
+}
+
+int main() {
+    char line[128], key[20];
+    int value;
+
+    printf("��J�s���r�媺���z�A��<Enter>�����{��\n");
+    while (1) {
+        printf("\n���O => ");
+        fgets(line, 128, stdin);
+
+        if (line[0] == '\n') break;
+
+        if (sscanf(line, "w[%[^]]] = %d", key, &value) == 2) {
+            insert(key, value);
+            printf("�s�Ww[%s]=%d\n", key, value);
+        } else if (sscanf(line, "w[%[^]]]?", key) == 1) {
+            student *found = search(key);
+            if (found)
+                printf("�r�夸��w[%s]=%d\n", key, found->score);
+            else
+                printf("���~! %s ���b����!\n", key);
+        } else if (line[0] == 'w' && line[1] == '?') {
+            show_tree();
+        }
+    }
+
+    free_tree(root);
+    free(head);
+    return 0;
+}
diff --git a/作業/unit7/try.exe b/作業/unit7/try.exe
new file mode 100644
index 0000000..8a87522
Binary files /dev/null and b/作業/unit7/try.exe differ
diff --git a/作業/「資料結構與演算法」期中考作答可用輸入.txt b/作業/「資料結構與演算法」期中考作答可用輸入.txt
new file mode 100644
index 0000000..b237495
--- /dev/null
+++ b/作業/「資料結構與演算法」期中考作答可用輸入.txt
@@ -0,0 +1,19 @@
+同學上傳作答內容所用網頁 https://bit.ly/47uMxaE 
+
+第1題可用輸入
+2x^0 - 1x^1  +1 x^3    -2x^2
+3x^4+9x^3-198x^2+156x^1+360x^0
+1x^5-10000x^3
++1198x^9-119800x^7+40000x^6-1000x^8+6x^10
+
+
+第2題可用輸入
+10.5+20.8*(50.1-30.6)/2.5^4-6.6*8.2
+10-30*(-40-20)%2^4+7.5*-6
+1+sin((-50.2+sin(3.8*20)*cos(-30-100%40))*2^-2.5)*cos(123.456)
+100*(sin(sin(sin(+50.2*cos((30+100%40)*sin(60/5.5)))+20*(+50/30.0)^3.5-6*8)))^2
+
+100*(sin(sin(sin(50.2*cos((30+100%40)*sin(60/5.5)))+20*(50/30.0)^3.5-6*8)))^2
+
+
+
diff --git a/作業/期中考/math_fun.cpp b/作業/期中考/math_fun.cpp
new file mode 100644
index 0000000..2703a5f
--- /dev/null
+++ b/作業/期中考/math_fun.cpp
@@ -0,0 +1,41 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+
+int main(){
+	int i = abs(-5);         // �ϥ� abs()
+	long l = labs(-5L);      // �ϥ� labs()
+	double d = fabs(-5.0);   // �ϥ� fabs()
+	
+//	����Ȩ�� fabs() 
+	double x1 = -5.7;
+	printf("����Ȭ�: %.2f\n", fabs(x1));  // ��X: 5.70
+		
+//	������ pow()
+	double base = 2.0, exponent = 3.0;
+	printf("2��3���謰: %.2f\n", pow(base, exponent));  // ��X: 8.00
+		
+//	����ڨ�� sqrt()
+	double x2 = 16.0;
+	printf("16������ڬ�: %.2f\n", sqrt(x2));  // ��X: 4.00
+		
+//	�L����˥h��� floor()
+	double x3 = 3.5;
+	printf("�L����˥h�ᬰ: %.2f\n", floor(10/2));  // ��X: 3.00
+		
+//	�L����i���� ceil()
+
+	printf("�L����i��ᬰ: %.2f\n", ceil(x3));  // ��X: 4.00
+		
+//	�|�ˤ��J��� round()
+
+	printf("�|�ˤ��J�ᬰ: %.2f\n", round(x3));  // ��X: 4.00
+	
+	int j=1 ,k=3;
+	j -= k ;
+	printf("%d",j);	
+		
+	
+	return 0;
+}
diff --git a/作業/期中考/math_fun.exe b/作業/期中考/math_fun.exe
new file mode 100644
index 0000000..bcdb161
Binary files /dev/null and b/作業/期中考/math_fun.exe differ
diff --git a/作業/期中考/string_fun.cpp b/作業/期中考/string_fun.cpp
new file mode 100644
index 0000000..fa4fc00
--- /dev/null
+++ b/作業/期中考/string_fun.cpp
@@ -0,0 +1,123 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+int main(){
+	
+	// �Y��J�t��\n���� �ϥΦ���Ʋ���\n
+	// �N���\n����m������\0 
+	name[strcspn(name, "\n")] = '\0';
+	
+//	strlen() - �p��r�����
+	char str[] = "Hello";
+	int length = strlen(str);  // ���G�� 5
+	printf("strlen(Hello) = %d\n",length);
+	
+//	strcpy() - �ƻs�r��
+	char dest[50];
+	char src[] = "Hello";
+	strcpy(dest, src);  // dest �{�b�]�t "Hello"
+	printf("strcpy(dest, Hello) => dest = %s\n",dest);
+	
+//	strcat() - �s���r��
+	char str1[50] = "Hello ";
+	char str2[] = "World";
+	strcat(str1, str2);  // str1 �{�b�O "Hello World"
+	printf("strcat(str1 = Hello, str2 = World) => str1 = %s\n",str1);
+
+//	strcmp() - ����r��
+	char str3[] = "Hello";
+	char str4[] = "Hello";
+	int result = strcmp(str3, str4);  // �ۦP�^�� 0�Astr1 �j�� str2 �^�ǥ��ơA�p��^�ǭt��
+	printf("strcmp(Hello, Hello) = %d\n",result);
+	
+//	strchr() - �M��r���b�r�ꤤ�Ĥ@���X�{����m
+	char str5[] = "Hello";
+	char *p1 = strchr(str5 , 'l');  // ���V�Ĥ@�� 'l' ����m
+	printf("strchr(Hello, 'l') = %p\n",*p1);
+	
+		
+//	strstr() - �M��l�r��b�r�ꤤ�Ĥ@���X�{����m
+	char str6[] = "Hello World HELLO";
+	char *p2 = strstr(str6, "World");  // ���V "World" �}�l����m
+//	char *p3 = strstr(NULL, " ");
+	printf("strstr(str6, World) = %d\n",p2 - str6 );
+//	printf("strstr(, HELLO) = %d\n",p3 - str6 );
+	
+	
+//	strchr�禡��������� 
+//	��ƭ쫬�Gchar *strchr(const char *str, int c)
+//	�\��G�b�r�ꤤ�M����w�r���Ĥ@���X�{����m
+//	��^�ȡG
+//	
+//	�Y���r���A��^�Ӧr�������w
+//	�Y�S���A��^ NULL
+//	
+//	�`�N�G�ĤG�ӰѼ����M�O int �����A����ڤW�|�Q�ഫ�� char �ӷj�M
+
+//	char str[] = "programming";
+//    char *p;
+//    // �M��r�� 'g'
+//    p = strchr(str, 'g');
+//    if (p != NULL) {
+//        printf("��� 'g' ����m: %ld\n", p - str);  // ��X�G3
+//        printf("�q�Ӧ�m�쵲�����l�r��: %s\n", p);  // ��X�Ggramming
+//    }
+//    
+//    // �M��Ҧ� 'm' ����m
+//    char *temp = str;
+//    while ((temp = strchr(temp, 'm')) != NULL) {
+//        printf("��� 'm' ����m: %ld\n", temp - str);
+//        temp++;  // ����U�@�Ӧ�m�~��j�M
+//    }
+//    
+//    // �M�䤣�s�b���r��
+//    p = strchr(str, 'z');
+//    if (p == NULL) {
+//        printf("�䤣��r�� 'z'\n");
+//    }
+	
+
+//	strstr() ���
+//	��ƭ쫬�Gchar *strstr(const char *haystack, const char *needle)
+//	�\��G�b�D�r��]haystack�^���M��l�r��]needle�^�Ĥ@���X�{����m
+//	��^�ȡG
+//	
+//	�Y���l�r��A��^�l�r�ꭺ���X�{��m�����w
+//	�Y�S���A��^ NULL
+//	
+//	�`�N�G�Ϥ��j�p�g
+
+//    char str[] = "This is a simple example of strstr function";
+//    char *p;
+//    
+//    // �򥻷j�M
+//    p = strstr(str, "simple");
+//    if (p != NULL) {
+//        printf("���l�r�ꪺ��m: %ld\n", p - str);  // ��X�G10
+//        printf("�q�Ӧ�m�쵲������r: %s\n", p);     // ��X�Gsimple example of strstr function
+//    }
+//    
+//    // �j�M���ƥX�{���l�r��
+//    char text[] = "hello hello hello";
+//    char *temp = text;
+//    while ((temp = strstr(temp, "hello")) != NULL) {
+//        printf("��� 'hello' ����m: %ld\n", temp - text);
+//        temp++;  // ����U�@�Ӧ�m�~��j�M
+//    }
+//    
+//    // �j�M�Ŧr��
+//    p = strstr(str, "");
+//    if (p != NULL) {
+//        printf("�Ŧr��ǰt��r��_�l��m\n");  // �|�ǰt��_�l��m
+//    }
+//    
+//    // �Ϥ��j�p�g���d��
+//    p = strstr(str, "SIMPLE");  // ���|���A�]���j�p�g���P
+//    if (p == NULL) {
+//        printf("�䤣�� 'SIMPLE'�A�]���O�Ϥ��j�p�g��\n");
+//    }
+
+	return 0;
+}
+
diff --git a/作業/期中考/string_fun.exe b/作業/期中考/string_fun.exe
new file mode 100644
index 0000000..2cb3d6d
Binary files /dev/null and b/作業/期中考/string_fun.exe differ
diff --git a/作業/老師程式/indirect-recursion-examples.zip b/作業/老師程式/indirect-recursion-examples.zip
new file mode 100644
index 0000000..4145f5f
Binary files /dev/null and b/作業/老師程式/indirect-recursion-examples.zip differ
diff --git a/作業/老師程式/recursive-check-path.c b/作業/老師程式/recursive-check-path.c
new file mode 100644
index 0000000..d47d0fc
--- /dev/null
+++ b/作業/老師程式/recursive-check-path.c
@@ -0,0 +1,57 @@
+/*
+Program: recursive-check-path.c
+Function: �H�������j���覡�˵��r��O�_�N�����Ī��ؿ������|�C���Ī����|���׽u�έY�z�^�Ʀr���զ���
+	�r��A���{���]isValidPath()�M�d�˵��D�^�Ʀr��(�׽u)�������A�Ѿl���^�Ʀr������checkPathChar()
+	�B�z�A��checkPathChar()�B��L�{���Y�o�{�׽u�r���A�N�I�sisValidPath()�A�z�L�o�G�Ө禡���۩I�s�A�F��
+	�˵����ĪG 
+Note: ���{���Y��ChatGPT���ͲĤ@�������ΨҡA���Ѯv�A�[�H�X�R��g�A�ƧU�P�Ǵx���������j�����H 
+*/
+ 
+#include <stdio.h>
+#include <string.h>
+
+int isValidPath(char *path);
+int checkPathChar(char *path);
+
+int isValidPath(char *path) {
+    if (path[0] == '\0') 
+		return 0; 	//�^��0�A�N��path��"�L��"���|
+    else if (path[0] == '/')
+		return checkPathChar(path+1);	//�����˵�path+1�N�����r��O�_�����ĸ��| 
+	else if (isalnum(path[0]))
+    	return checkPathChar(path); 	//�I�scheckPathChar()�˵�path�N�����r��O�_�����ĸ��|
+    else
+    	return 0;	//�^��0�A�N��path��"�L��"���| 
+}
+
+int checkPathChar(char *path) {
+    if (path[0] == '\0') 
+		return 1;	//�^��1�A�N��path��"����"���|
+	else if (isalnum(path[0]))	//���Upath�����^�Ʀr���A�h�~��I�scheckPathChar�˵����U�Ӫ��r����O�_�ŦX 
+		return checkPathChar(path+1);
+	else if ((path[0] == '/') && (path[1] != '/'))	//����s��X�{"//" 
+		return isValidPath(path+1);
+	else 
+        return 0;	//�^��0�A�N��path��"�L��"���| 
+}
+
+int main() {
+    char *paths[] = {
+        "/home/user/docs",          //����
+        "/home/user//docs",         //�L��(�t���s��G�ӥ��׽u'/'�Ÿ�)
+        "/home/user/abc!", //�L��(�]�t�D�^�Ʀr��)
+        "/documents",               //����
+        "!valid/start",            	//�L��
+        "/home/1234"                //����
+    };
+
+    int i, count = sizeof(paths)/sizeof(paths[0]);
+
+    for (i = 0; i < count; i++) 
+        if (isValidPath(paths[i])) 
+            printf("\"%s\" �����ĸ��| ��\n",paths[i]);
+        else 
+            printf("\"%s\" �D���ĸ��| X\n",paths[i]);
+
+    return 0;
+}
diff --git a/作業/老師程式/recursive-check-path.exe b/作業/老師程式/recursive-check-path.exe
new file mode 100644
index 0000000..0321961
Binary files /dev/null and b/作業/老師程式/recursive-check-path.exe differ
diff --git a/作業/老師程式/recursive-series=proc.c b/作業/老師程式/recursive-series=proc.c
new file mode 100644
index 0000000..7685545
--- /dev/null
+++ b/作業/老師程式/recursive-series=proc.c
@@ -0,0 +1,33 @@
+/*
+Program: recursive-series-proc.c (Report comments/bugs to chikh@yuntech.edu.tw) 
+Function: �H�������j���覡���G�ӼƦC�i��ӧO�����ۭ��A�A�N�ӧO���n�[�`�A�������G�ӦV�q�i�椺�n
+	(inner product)�B��C���{���]mul()��ƱM�d�i��ƦC�������������ۭ��B��A�⭼�n���G�浹add()
+	�禡�@�[�`�Fadd()���A�I�smul()�A�n�Dmul()�p��Ѿl���������n�A�p�����йB��C�z�L�o�G�Ө�Ƥ�
+	�۩I�s�A�F��ĪG
+*/
+
+#include <stdio.h>
+
+int mul(int *, int *, int);
+int add(int *, int *, int, int);
+
+int mul(int *A, int *B, int i) {
+	int c; 
+    if ((c=A[i]*B[i]) == 0) 
+		return 0; 
+	else
+    	return add(A,B,i+1,c);	//��c�֥[��
+}
+
+int add(int *A, int *B, int i, int c) {
+	return c+mul(A,B,i);
+}
+
+int main() {
+    int A[] = { 1, 2, 3, 4, 5, 0}, 
+	    B[] = {-1,-2,-3,-4,-5, 0};	//�̥�����0�A�N���ƦC�ܦ������A�����B��]�N�b���i�@�q�� 
+		 
+	printf("\n�G�ƦC�ӧO�������n�M = %d",mul(A,B,0));
+
+    return 0;
+}
diff --git a/作業/老師解答/unit2/poly-integer-root-v3.c b/作業/老師解答/unit2/poly-integer-root-v3.c
index a3f5e8a..2b23353 100644
--- a/作業/老師解答/unit2/poly-integer-root-v3.c
+++ b/作業/老師解答/unit2/poly-integer-root-v3.c
@@ -62,7 +62,6 @@ int findRoot(int p[], int q[]) /* 
 	
 	if (p[2*p[0]-1] != 0) { /* �̧C���������� >= 1�A�h0���i��� */ 
 		if ((i=p[2*p[0]-1]) > 0) q[c++] = 0;	/* �̧C���������Ƴ]��i */
-		printf("\ni = %d\n",i);
 		for (j = 1; j < 2*p[0]; j+=2) p[j] -= i;/* �Ҧ����������ƴ�hi */ 
 	}
 	
@@ -92,8 +91,7 @@ void show(int p[], int n, int mode)
 				printf("%s",p[i]==0? "\b-1":"\b-");
 			switch(p[i]) {
 				case 0: 
-					if(p[i+1]==1) printf("1+");
-					else printf("+");
+					printf("+");
 					break;
 				case 1:
 					printf("x+");
diff --git a/作業/老師解答/unit2/poly-integer-root-v3.exe b/作業/老師解答/unit2/poly-integer-root-v3.exe
index d70f7ae..9770fec 100644
Binary files a/作業/老師解答/unit2/poly-integer-root-v3.exe and b/作業/老師解答/unit2/poly-integer-root-v3.exe differ