sombochea/sbn.cassigment
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fixed search the student

Browse Source
This commit is contained in:
Sambo Chea 2020-08-03 11:34:26 +07:00
parent 7bffb64752
commit f8749e3427
1 changed files with 10 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
work1/single.c
View File

@ -241,7 +241,7 @@ void search_student()
STUDENT *found_student = search_student_by_name_or_id(search_key); STUDENT *found_student = search_student_by_name_or_id(search_key);
if (found_student == NULL) if (found_student == NULL)
{ {
printf("No student found!"); printf("\nNo student found!\n");
return; return;
} }
@ -260,6 +260,13 @@ STUDENT *search_student_by_name_or_id(char search_key[NAME_SIZE])
if (strcmp(temp->student_info.name, search_key) == 0 || strcmp(temp->student_info.id, search_key) == 0) if (strcmp(temp->student_info.name, search_key) == 0 || strcmp(temp->student_info.id, search_key) == 0)
{ {
printf("\nSearch found with key: %s\n", search_key); printf("\nSearch found with key: %s\n", search_key);
// set the temp next to null
// and free up the memory
temp->next = NULL;
free(temp->next);
// return the current temp
// that found in current search
return temp; return temp;
} }
temp = temp->next; temp = temp->next;
@ -323,7 +330,7 @@ int find_min_in_array(int *array)
STUDENT *add_last_student(STUDENT *nodes, STUDENT *element) STUDENT *add_last_student(STUDENT *nodes, STUDENT *element)
{ {
STUDENT *temp = nodes, *node; STUDENT *temp = nodes, *node;
node = (struct student_tag*) malloc(sizeof(struct student_tag)); node = (struct student_tag *)malloc(sizeof(struct student_tag));
node->student_info = element->student_info; node->student_info = element->student_info;
node->course_info = element->course_info; node->course_info = element->course_info;
node->next = NULL; node->next = NULL;