오늘보다 내일의 내모습을 생각하자. 개발자가 되길...

#include #include #include #define ARR_MAX 20 int sorted[ARR_MAX]; void merge(int Data[],int Left, int middle, int right){ int i = Left; int m = Left; int j = middle + 1; int AAA = 0; while(i

#include #include typedef struct Node { struct Node *Left; struct Node *Right; char Data; }Node; Node * MakeTree(char Data); void deleteTree(Node * Data); void DestroyTree(Node * Data); void ConnectTree(Node * Data); void PreorderPrint(Node *Data); void InorderPirnt(Node *Data); void PostPrint(Node *Data); int main() { Node * A = MakeTree('A'); Node * B = MakeTree('B'); Node * C = MakeTree('C');..

#include #include typedef char ElementType; typedef struct LCRSNode { struct LCRSNode * LeftChild; struct LCRSNode * RightSibling; ElementType Data; }LCRSNode; LCRSNode* LCRS_CreateNode(ElementType NewData); void LCRS_DestroyNode( LCRSNode* Node ); void LCRS_DestroyTree( LCRSNode* Root ); void LCRS_AddChildNode( LCRSNode * Parent, LCRSNode * Child); void LCRS_PrintTree( LCRSNode * Node, int Dept..

void ShakerSort(int Data[], int nCount) { int Left = 0; int Right = nCount; int ChaData = 0; int count = 0; int count1 = 0; int shift = 0; while(Left Data[count+1]) { ChaData = Data[count]; Data[count] = Data[count+1]; Data[count+1] = ChaData; shift = count; } } Right = shift; for(count = Right; count > Left; count--) { if(Dat..

void BubbleSort(int Data[],int nCount) { int count = 0; int CmpData = 0; int count1 = 0; int ChaData = 0; for(count = 0; count count; count1--) { if(Data[count1]

#include #include #include #define MAX 100 void DynamicSort(int Data[],int nCount) { int count = 0; int CmpData = 0; int count1 = 0; int ChaData = 0; for(count = 0; count

#include int main() { int Data = 0; int Data1 = 0; int m = 0; int n = 0; int result = 0; printf("Data input : "); scanf("%d %d",&Data,&Data1); m = Data; n = Data1; do{ result = m % n; m = n; n = result; }while(result != 0); printf("Data : %d\n",m); return 0; } 기존의 두 데이터 값을 나머지 연산자를 이용하여 나머지를 구합니다. 그다음 기존의 데이터2가 1으로 이동하고 나머지값이 데이터 2로 이동합니다. 이처럼 나머지가 0이 나오면 나눈 인자값이 최대공약수가 됩니다 ㅎㅎ

#include #include #include enum {FALSE=0,TRUE}; typedef struct Operation_Stack { char Data; struct Operation_Stack * beforeStack; }Operation_Stack; typedef struct Number_Stack { char Data; struct Number_Stack * NextStack; }Number_Stack; typedef struct Top { struct Operation_Stack * OperationTop; struct Number_Stack * NumberHead; }Top; void OperationPop(Top ** top); int NumberPush(Top ** top, cha..

#include #include #include typedef struct Stack { int Data; struct Stack * BeforeStack; }Stack; Stack *Top = NULL; int Push(int Data) { Stack * StackData = (Stack *)calloc(1,sizeof(Stack)); if(StackData == NULL) exit(0); StackData->Data = Data; StackData->BeforeStack = NULL; if(Top == NULL) Top = StackData; else { StackData->BeforeStack = Top; Top = StackData; } return 1; } int Pop(void) { int D..

#include #include typedef struct Node { struct Node *PrevNode; int Data ; struct Node *NextNode; }List_Node; List_Node *create(int Data) { List_Node * NewNode; NewNode = (List_Node *)malloc(sizeof(*NewNode)); NewNode->Data = Data; NewNode->NextNode = NewNode; NewNode->PrevNode = NewNode; return NewNode; } int Add(List_Node ** Head, List_Node * NewNode) { if((*Head) == NULL) { *Head = NewNode; (*..