ingbeeni

#include typedef struct AvlNode {int data;struct AvlNode *left_child, *right_child;} AvlNode;AvlNode *root; AvlNode * rotate_LL(AvlNode *parent) {AvlNode *child = parent->left_child;parent->left_child = child->right_child;child->right_child = parent;return child;} AvlNode * rotate_RR(AvlNode *parent){AvlNode *child = parent->right_child;parent->right_child = child->left_child;child->left_child =..

#include #include #include #define KEY_SIZE 10 // 탐색키의 최대길이 #define TABLE_SIZE 13 // 해싱 테이블의 크기=소수 #define equal(e1,e2) (!strcmp(e1.key,e2.key)) typedef struct { char key[KEY_SIZE]; // 다른 필요한 필드들 } element; typedef struct listNode { element item; struct listNode *link; } ListNode; ListNode *hash_table[TABLE_SIZE]; // 문자로 된 탐색키를 숫자로 변환 int transform(char *key) { int number=0; // 간단한 덧셈 방식 사용 자연수 ..

/* * consolapplicaton.c * * Created on: 2014. 11. 18. * Author: SEC */ #include #include #include #define KEY_SIZE 10 #define TABLE_SIZE 13 #define empty(e) (strlen(e.key)==0) #define equal(e1,e2) (!strcmp(e1.key,e2.key)) #define NULL 0 typedef struct { char key[KEY_SIZE]; }element; element hash_table[TABLE_SIZE]; void init_table(element ht[]){ int i; for(i=0; i

#include #include #define TRUE 1#define FALSE 0#define MAX_VERTICES 7#define INF 1000 int weight[MAX_VERTICES][MAX_VERTICES] = {{ 0, 7, INF, INF, 3, 10, INF},{ 7, 0, 4, 10, 2, 6, INF},{ INF, 4, 0, 2, INF, INF, INF},{ INF, 10, 2, 0, 11, 9, 4},{ 3, 2, INF, 11, 0, INF, 5},{ 10, 6, INF, 9, INF, 0, INF },{ INF, INF, INF, 4, 5, INF, 0}}; int distance[MAX_VERTICES];int found[MAX_VERTICES]; int choose(i..

#include #include #define MAX_VERTICES 100 #define INF 1000 #define MAX_ELEMENT 100 #define TRUE 1 #define FALSE 0 int parent[MAX_VERTICES]; int num[MAX_VERTICES]; typedef struct { int key; // 간선의 가중치 int u; // 정점1 int v; // 정점 2 }element; void set_init(int n) { int i; for( i=0; i=0; i=p); // i=3, p=1, i=p=1 s = i; // i=1, p=0, i=p=0 for( i=vertex; (p=parent[i])>=0; i=p) // i=0, p=-1, 종료 parent[..

#include #include #define TRUE 1 #define FALSE 0 #define MAX_VERTICES 50 #define MAX_QUEUE_SIZE 100 // ---- 큐 소스코드 시작 ------------------------------------------------------- typedef int element; typedef struct { element queue[MAX_QUEUE_SIZE]; int front, rear; } QueueType; void error(char *message) { fprintf(stderr,"%s\n",message); exit(1); } // 초기화 함수 void init(QueueType *q) { q->front = q->rear..

#include #include #define TRUE 1#define FALSE 0#define MAX_VERTICES 50int visited[MAX_VERTICES];typedef struct GraphNode {int vertex;struct GraphNode *link;} GraphNode; typedef struct GraphType {int n;GraphNode *adj_list[MAX_VERTICES];} GraphType; void graph_init(GraphType *g) {int v;g->n = 0;for(v=0; vadj_list[v] = NULL;} void insert_vertex(GraphType *g, int v){if( ((g->n)+1 > MAX_VERTICES )){f..

#include #include #include #include"Queue.h" #define MAX_ARR_SIZE 10000 #define SWAP(a,b,t) ( (t) = (a), (a) = (b), (b) = (t)) void quick_sort(int list[], int left, int right); int partition(int list[],int left,int right); void bubble_sort(int *list, int n); void insertion_sort(int list[], int n); void Selection_Sort(int list[], int n); -----------------------------------------------------------..