#include #include #include struct Animal{ char name[20]; double nValue; struct Animal *pre; struct Animal *next; }; struct List { int length; struct Animal* first; struct Animal* last; }; void initList(struct List*); void add(struct List*, struct Animal*); void addInIndex(struct List *, struct Animal *, int); struct Animal* makeAnimal(char*); struct Animal* getNodeAt(struct List*, int); double s..

#include #include #include typedef struct Student { int id; char name[40]; int age; } Student; struct ArrayList { Student *dataSet; int length; }; void initList(struct ArrayList *list){ list->dataSet = calloc(100, sizeof(Student)); list->length = 0; } void add(struct ArrayList *list, struct Student *student){ list->dataSet[list->length] = *student; list->length = list->length + 1; } void display..

#include void main(int args, char **argv){ FILE *source, *destination; char buffer; source = fopen(argv[1], "r+"); destination = fopen(argv[2], "w+"); buffer = fgetc(source); while(buffer != EOF){ fputc(buffer, destination); buffer = fgetc(source); } } copy a.txt b.txt 하면 스윽 옮겨서 저장해주는 프로그램 ^^ 신기해.. MSDOS 시절 생각이 납니다-

#include #include #include typedef struct Node { struct Book *data; struct Node *next; } node; typedef struct Book { // 제목, 저자, 출판사, 출판일, 가격 char title[30]; char author[20]; char publisher[20]; int date; int price; }; typedef struct LinkedList { int length; struct Node *fNode; }linkedList; // 1. 기본적인 링크드 리스트 함수 void initList(struct LinkedList*); node* getNodeAt(struct LinkedList*, int); void add..

#include #include #include struct Datas { char name[40]; char address[50]; char msg[60]; } ; void main(){ FILE *fp; char buffer[1024]; char *temp; int i=0; struct Datas* data = malloc(sizeof(struct Datas)); fp = fopen("Hello.txt", "r+"); fgets(buffer, 1024, fp); temp = strtok(buffer, "/"); strcpy(data->name, temp); temp = strtok(NULL, "/"); strcpy(data->address, temp); temp = strtok(NULL, "/"); ..

#include #include typedef struct Node { int data; struct Node *next; } node; typedef struct LinkedList { int length; struct Node *fNode; }linkedList; node* firstNode; int length; void initList(struct LinkedList*); node* getNodeAt(struct LinkedList*, int); void add(struct LinkedList*, int); void addInIndex(struct LinkedList*, int , int); void erase(struct LinkedList*, int); void replace(struct Li..