*원* 스토어

*원*

개인

팔로워0 팔로우

소개

등록된 소개글이 없습니다.

전문분야 등록된 전문분야가 없습니다.

판매자 정보

학교정보

입력된 정보가 없습니다.

직장정보

입력된 정보가 없습니다.

자격증

입력된 정보가 없습니다.

판매지수

판매중 자료수

6개
전체 판매량

11개
최근 3개월 판매량

0개
자료후기 점수

평균A
자료문의 응답률

-

전체자료 6개

[이진트리] avl트리 구현과 구현된 트리를 infix,prefix,postfix방식으로 확인하기

#include <stdlib.h>#include <stdio.h>#include <conio.h>#define IS_FULL(ptr) (!(ptr))#define FALSE 0;#define TRUE 1;typedef struct { int key; } element;typedef struct tree_node *tree_pointer;struct tree_node {tree_pointer left_child;element data;int bf;tree_pointer right_child;};int unbalanced=FALSE;tree_pointer root=NULL;void displaymenu(void);int getselect(void);int choice(int);void avl(void);void avl_insert(tree_pointer *,element,int *);void left_rotation(tree_pointer *,int *);void right_rotation(tree_pointer *,int *);void pre(void);void in(void);void post(void);void inorder(tree_pointer);

공학/기술| 2004.07.05| 10페이지| 1,000원| 조회(1,403)

infix, avl, prefix, post, 균형트리

미리보기

닫기
[sorting] sorting에 걸리는 시간 비교측정하는 프로그램

#include <stdlib.h>#include <stdio.h>#include <time.h>#include <windows.h>void displaymenu(void);void quicksort(void);void mergesort(void);void mergesorting(int [],int,int);void merge(int [],int,int,int);void countingsort(void);void quick(int [],int,int);void counting(int [],int [],int);int partition(int [],int,int);int getselect(void);int choice(int);int num=0;void main(void){int quit,select;do{displaymenu();select=getselect();quit=choice(select);}while(!quit);}

프로그램소스| 2004.07.05| 5페이지| 1,000원| 조회(604)

merge, quick, sort, count

미리보기

닫기
[자료구조] dfs & prim

#include <stdio.h>#include <stdlib.h>#include <string.h>#define MAX 50struct graphlist {int vertex;int weight;graphlist *link;graphlist *end;};typedef struct graphlist *graph;typedef struct queue *queue_ptr;typedef struct queue {int vertex;queue_ptr first;queue_ptr link;queue_ptr last;};typedef struct prim {int value;int root;int child;};void insert(queue_ptr ,int);int delet(queue_ptr);void displaymenu(void);int getselect(void);int choice(int);int filedatasize(char *);void readgraph(void);void dfs(int);void traverse1(void);void traverse2(void);void primi(void);

공학/기술| 2004.04.07| 10페이지| 1,000원| 조회(477)

linked list, dfs, graph, prim

미리보기

닫기
[linked list] double linked list

#include #include #include struct ch_node { ch_node *llink; char data; ch_node *rlink;};//char 하나를 갖고 있는 노드들 스트링의 한문자씩 나눠서 저장되었으며 이중 링크드 리스트를 이용하여 구성 //typedef ch_node *ch_ptr;struct listnode { listnode *hint; char *name; ch_node *first;int value;};// 스트링의 머리 역할을 함 name에는 스트링의 이름이 저장 value에는 스트링의 길이를 저장 first에 스트링의 첫문자를 갖고 있는 노드가 연결됨 리스트는 리스트끼리 연결되있음//typedef listnode *list;struct headnode { listnode *sea; listnode *land;}; //전체 노드들의 헤더, sea에는 첫 스트링의 리스트를 넣고 land에는 마지막 스트링의 리스트를 삽입//typedef headnode *head;head makehead(void);list makelist(void);ch_ptr makeptr(void);void creat(head);void len(head );void copy(head);void concat(head);void index(head);void substr(head);void first(head);void last(head);void prints(head);void displaymenu(void);int getselect(void);int choice(int,head);void main(void){head a;a=makehead();int quit,select;printf("n");do{displaymenu();select=getselect();quit=choice(select,a);}while(!quit);}head makehead(void){head a;a=(head)malloc(sizeof(struct headnode));a->sea5:index(a);break;case 6:substr(a);break;case 7:first(a);break;case 8:last(a);break;case 9:prints(a);break;case 10:quit=1;}return(quit);}void creat(head b){int len,q;char *n1,*n2,c;list xyz;xyz=makelist();printf("Name of a New string and the string you creat:");n1=(char *)malloc(sizeof(20));n2=(char *)malloc(sizeof(20));scanf("%s%s",n1,n2);if((b->sea)==NULL){b->sea=xyz;xyz->name=n1;}else{list nba;nba=makelist();nba=b->sea;while(nba){if(!(nba->hint)){nba->hint=xyz;xyz->name=n1;break;}nba=nba->hint;}}b->land=xyz;len=strlen(n2);if(lenvalue=len;FILE *fop,*frp;fop=fopen("test.txt","w");q=fputs(n2,fop);fclose(fop);frp=fopen("test.txt","r");c=fgetc(frp);ch_ptr vox,vox2;vox=makeptr();vox2=makeptr();xyz->first=vox;vox->data=c;vox2=vox;for(int i=0;irlink=box;box->llink=vox;box->data=c;vox=vox->rlink;}vox->rlink=vox2;vox2->llink=vox;fclose(frp);int j;j=remove("test.txt");printf("n");}}void first(head v){int num;list sin;char ch[10];printf("This is first moden");printf("Two input:");scanf("%s%d",ad v){int num;list sin;char ch[10];printf("This is last moden");printf("Two input:");scanf("%s%d",ch,&num);if(v->sea==NULL){printf("error");}sin=makelist();sin=v->sea;while(sin){if(strcmp(ch,sin->name)==0 && numvalue)){char *nam;nam=(char *)malloc(sizeof(10));printf("What is the new string name:");scanf("%s",nam);list gg;gg=makelist();v->land->hint=gg;gg->name=nam;gg->value=num;v->land=gg;ch_ptr home;home=makeptr();gg->first=home;ch_ptr ng;ng=makeptr();ng=sin->first;printf("%s is ",gg->name);for(int t=0;tllink;}home->data=ng->data;printf("%c",home->data);for(int i=0;irlink=ho;ho->llink=home;ho->data=ng->rlink->data;printf("%c",ho->data);home=home->rlink;ng=ng->rlink;}printf("nn");home->rlink=gg->first;gg->first->llink=home;break;}sin=sin->hint;}}void len(head a){char sum[10];printf("What is the string name? ");scanf("%s",sum);list c;c=makelist();c=a->sea;while(c){if(strcmp(c->name,sum)==0){printf("%s is length %d",sum,c->value);break;}c=c->hint;}printf("n");printf("n");}void print->hint=sin;sin->name=n2;a->land=sin;printf("%s is ",sin->name);sin->value=alist->value;sin->first=copy;ptr=alist->first;copy->data=ptr->data;printf("%c",copy->data);for(int i=0;ivalue)-1;i++){ch_ptr add;add=makeptr();copy->rlink=add;add->llink=copy;add->data=ptr->rlink->data;printf("%c",add->data);copy=copy->rlink;ptr=ptr->rlink;}printf("nn");copy->rlink=sin->first;sin->first->llink=copy;break;}alist=alist->hint;}}void concat(head up){char n1[10],n2[10];printf("Two strings are:");scanf("%s%s",n1,n2);list alist,blist;alist=makelist();blist=makelist();alist=up->sea;blist=up->sea;int a=0;while(alist){if(strcmp(alist->name,n1)==0){a++;break;}alist=alist->hint;}while(blist){if(strcmp(blist->name,n2)==0){a++;break;}blist=blist->hint;}if(a==2){char *dom;dom=(char *)malloc(sizeof(10));printf("What is the new string name?:");scanf("%s",dom);list com;ch_ptr ptr,aptr;com=makelist();ptr=makeptr();aptr=makeptr();up->land->hint=com;up->land=com;com->name=dom;com->first=ptr;com->value=(alist->valueelist();blist=makelist();alist=up->sea;blist=up->sea;int a=0;int dex=1;while(alist){if(strcmp(alist->name,n1)==0){a++;break;}alist=alist->hint;}while(blist){if(strcmp(blist->name,n2)==0){a++;break;}blist=blist->hint;}ch_ptr fptr;fptr=makeptr();fptr=alist->first;if((a==2) && (alist->value)>=(blist->value)){while(alist->first){ch_ptr aptr;aptr=makeptr();aptr=alist->first;if((aptr->data)==(blist->first->data)){ch_ptr bptr;bptr=makeptr();bptr=blist->first;int j=0;for(int i=0;ivalue)-1;i++){aptr=aptr->rlink;bptr=bptr->rlink;if((aptr->data)==(bptr->data)){j++;}}if(j==((blist->value)-1)){printf("The index of %s in %s is %dn",n2,n1,dex);while((alist->first)!=fptr)alist->first=alist->first->rlink;break;}}alist->first=alist->first->rlink;dex++;}}printf("n");}void substr(head up){char n[10];int n1=0,n2=0;printf("Three inputs:");scanf("%s%d%d",n,&n1,&n2);list alist;alist=makelist();alist=up->sea;while(alist){ch_ptr fptr;fptr=makeptr();fptr=alist->first;if(strcmp(n,(alist->name))==0 && (alist->vat;}}

공학/기술| 2004.04.07| 12페이지| 1,000원| 조회(577)

linked list, Double, 문자열의 사칙연산

미리보기

닫기
[자료구조] sparse matrix 평가A좋아요

#include #include #include #define MAX 100struct head{struct sparsematrix *matrix[10];char *make[10];};typedef struct head *headnode;struct sparsematrix{struct sparsematrix *row, *col;int arow,acol,value;};typedef struct sparsematrix *sparse;void displaymenu(void);int getselect(void);int choice(int,headnode);void makesparse(headnode);void showsparse(headnode);void erasesparse(headnode);void addsparse(headnode);void subsparse(headnode);void multisparse(headnode);void transsparse(headnode);sparse creatsparse(headnode);headnode makehead(void);int size;int name=0;//전역 변수들 설정 size는 행렬의 크기를 나타내고 name은 프로그램에 존재하는 행렬의 개수이다.//void main(void){headnode header; //header는 전체 행렬들의 headnode이다.//header=makehead();int quit,select;printf("what's size sparse matrix:");scanf("%d",&size);printf("n");do{displaymenu();select=getselect();quit=choice(select,header);}while(!quit);}headnode makehead(void){headnode ahead;ahead=(headnode)malloc(sizeof(struct head));for(int i=0;imake[i]=NULL;ahead->matrix[i]=NULL;ntf("errorn");exit(EXIT_FAILURE);}newsparse->col=newsparse->row=NULL;return(newsparse);}void displaymenu(void){printf("Main Menunn");printf("1.Reads in a sparse matrixn");printf("2.Writes out the contents of a sparse matrixn");printf("3.Erases a sparse matrixn");printf("4.Add two sparse matricesn");printf("5.Subtracts two sparse matricesn");printf("6.Multiplies two sparse matricesn");printf("7.Transposes a sparse matrixn");printf("8.Exitn");}int getselect(void){int a;printf( "Make your Choice?:");scanf("%d",&a);return a;}int choice(int choi,headnode a){int quit=0;switch(choi){case 1:makesparse(a);break;case 2:showsparse(a);break;case 3:erasesparse(a);break;case 4:addsparse(a);break;case 5:subsparse(a);break;case 6:multisparse(a);break;case 7:transsparse(a);break;case 8:quit=1;break;}return(quit);}void makesparse(headnode fly) //0이 아닌 숫자를 입력할때마다 그 숫자의 정보를 노드에 저장한다.//{char *x;int number;sparse b;x=(char *)malloc(sizeof(100));b=creatsparse();fly->matrix[name]=b;printf("what's ttf("n");}name++;}void showsparse(headnode header) //만들어진 행렬을 보여준다.//{char write[10];int show[MAX]={0};int q=0;printf("what's the name of matrix:");scanf("%s",write);printf("n");for(int i=0;imake[i])==0){q=1;sparse print;print=creatsparse();print=header->matrix[i];for(int sd=0;sdarow)*size+print->acol)){show[sd]=print->value;print=print->row;}}printf("matrix(");printf("%s",write);printf(")=n");for(int j=0;jmatrix[i]!=NULL){header->matrix[i]=NULL;header->make[i]=NULL;by=0;z++;}}}name=name-z;if(by){printf("matrix(");printf("%s",a);printf(")is can't erasenn");}free(a);}void transsparse(headnode header) //행렬들을 전치시킨다.//{char write[10];int show[MAX]={0};int q=0;printf("what's the trans's name of matrix:");scanf("%s",write);printf("n");for(int i=0;imake[i])==0){q=1;sparse print;print=creatsparse();print=header->matrix[i];while(print){int sd=((print->acol)*size+(print->arow));for(int n=0;nvalue;}}print=print->row;}printf("matrix(");printf("%s",write);printf(")=n");for(int j=0;jmatrix[i];r->make[name]=x;printf("nn");b=a;while(a){if(a->row==NULL){a->row=header->matrix[j];break;}a=a->row;}while(b){int sd=((b->arow)*size+(b->acol));for(int n=0;nvalue;}}b=b->row;}for(int q=0;qmatrix[name]=c;for(int h=0;harow=(h/size);c->acol=(h%size);c->value=show[h];c->row=d;c=c->row;}}}}free(a);free(b);}if(y==1){name++;}}void subsparse(headnode header) //행렬들을 빼는 함수//{sparse a,b,e;int show[MAX]={0};int s=0;int y=0;a=creatsparse();b=creatsparse();e=creatsparse();char n1[10],n2[10];printf("what's substract sparse matrix:");scanf("%s",n1);printf(" , ");scanf("%s",n2);printf("n");printf("matrix(");printf("%s",n1);printf("-");printf("%s",n2);printf(")=nn");for(int i=0;imake[i])==0){a=header->matrix[i];s=1;}}if(s){for(int j=0;jmake[j])==0){y=1;printf("what's name of matrix:");char *x;x=(char *)malloc(sizeof(10));scanf("%s",x);header->make[name]=x;printf("nn");b=a;sparse c;c=creatsparse();c=header->matrix[j];while(c){c->value=-1*(c->value);c=c->row;}while(a){if(a->row==NULL){a->row=header(d){d->value=-1*(d->value);d=d->row;}header->matrix[name]=e;for(int h=0;harow=(h/size);e->acol=(h%size);e->value=show[h];e->row=d;e=e->row;}}}}free(a);free(b);}if(y==1){name++;}}void multisparse(headnode header) //행렬의 곱을 수행하는 함수//{char *x;char d[10],e[10];printf("what's multiple matrix?:");scanf("%s",d);printf(",");scanf("%s",e);sparse a,b,c;int show[MAX]={0};int s=0;int t=0;int y=0;a=creatsparse();b=creatsparse();c=creatsparse();printf("n");printf("matrix(");printf("%s",d);printf("*");printf("%s",e);printf(")=nn");for(int i=0;imake[i])==0){a=header->matrix[i];s=1;}}if(s){for(int j=0;jmake[j])==0){y=1;printf("what's name of matrix:");x=(char *)malloc(sizeof(10));scanf("%s",x);header->make[name]=x;printf("nn");c=header->matrix[j];header->matrix[name]=b;sparse ong;ong=creatsparse();ong=c;while(a){c=ong;while(c){if((a->acol)==(c->arow)){sparse sin;sin=creatsparse();b->value=(a->value)*(c->value);b->acol=c->acol;b->arow=a->arow;b->row=sin;b=b->row;}c=c->row;}a=a->row;}sparse win;win=c=0;q

공학/기술| 2004.04.07| 12페이지| 1,000원| 조회(810)

sparse matrix, linked list를 이용하, sparse ma..

미리보기

닫기