알고리즘/이론

Score.h #pragma once typedef struct { int number; double score; } Score; Score DataSet[] = { /* 번호, 점수*/ 1, 877.88, 2, 176.23, 3, 365.92, 4, 162.44, 5, 148.86, 6, 89.74, 7, 342.52, 8, 811.02 }; BinarySearch.c #include #include #include "Score.h" Score* BinarySearch(Score ScoreList[], int Size, double Target) { int Left, Right, Mid; Left = 0; Right = Size - 1; while (Left ScoreList[Mid].score) { ..

링크드 리스트 #ifndef LINKEDLIST_H #define LINKEDLIST_H #include #include typedef int ElementType; typedef struct tagNode{ ElementType Data; struct tagNode* NextNode; }Node; /* 함수 원형 선언 */ Node* SLL_CreateNode(ElementType NewData); void SLL_DestroyNode(Node* Node); void SLL_AppendNode(Node** Head, Node* NewNode); void SLL_InsertAfter(Node* Current, Node* NewNode); void SLL_InsertNewHead(Node**, Node* ..