예제 #1
0
int main()
{
  int N,MAX;
  printf("Please input the length of your randomness list: ");
  scanf("%d",&N);
  printf("Please set the MAX number of random range: ");
  scanf("%d",&MAX);
  int a1[N];
  generator(a1, N, MAX);
  printlist2(a1, N);
  SelectSort(a1, N);
  printlist2(a1, N);  
  return 0;
}
예제 #2
0
파일: main.c 프로젝트: kakas4/C_programming
int main(int argc,char* argv[])
{
    FILE *fIN=NULL;
    FILE *fOUT=NULL;
    if(processArgs(argc,argv,&fIN,&fOUT))
    {
        char* buff=malloc(256);char name[10],asdf[10];
        int node,from,to,offset;
        ListT* listn=(ListT*)malloc(sizeof(ListT));
        ListT* liste=(ListT*)malloc(sizeof(ListT));
        listn->first=NULL;
        liste->first=NULL;
        listn->lenght=0;
        liste->lenght=0;
        fgets(buff,256,fIN);
        sscanf(buff,"%s %s",name,asdf);
        buff+=strlen(name)+strlen(asdf)+2;
        Nodedata* toins=(Nodedata*)malloc(sizeof(Nodedata));
        while(sscanf(buff,"%d%n",&node,&offset))
        {
            buff+=offset;
            if(offset<strlen(buff))
            {
                toins=createdata1(node);
                insert(listn,toins);
            }
        }
        printlist1(listn);



        int offset1;
        fgets(buff,256,fIN);
        sscanf(buff,"%s %s",name,asdf);
        buff+=strlen(name)+strlen(asdf)+2;
        Edgedata* toins1=(Edgedata*)malloc(sizeof(Edgedata));
        while(sscanf(buff,"(%d%n %d%n)",&from,&offset,&to,&offset1))
        {
            buff+=offset+offset1;
            if(offset+offset1<strlen(buff))
            {
                toins1=createdata2(from,to);
                insert(liste,toins1);
            }
        }
        printlist2(liste);


        ListT* listnew=(ListT*)malloc(sizeof(ListT));
        listnew->first=NULL;
        listnew->lenght=0;
        fgets(buff,256,fIN);
        sscanf(buff,"%s %s",name,asdf);
        buff+=strlen(name)+strlen(asdf)+2;
        while(sscanf(buff,"%d%n",&node,&offset))
        {
            buff+=offset;
            if(offset<strlen(buff))
            {
                toins=createdata1(node);
                insert(listnew,toins);
            }
        }
        printlist1(listnew);

        NodeT* pWalker=liste->first;

        ListT* listnewedge=(ListT*)malloc(sizeof(ListT));
        listnewedge->first=NULL;
        listnewedge->lenght=0;
        int newfrom,newto;
        newfrom=((Edgedata*)(pWalker->data))->from;
        newto=((Edgedata*)(pWalker->data))->to;
        while(pWalker!=NULL)
        {

            newfrom=((Edgedata*)(pWalker->data))->from;
            newto=((Edgedata*)(pWalker->data))->to;
            if(find(listnew,newto)&&find(listnew,newfrom))
            {
                toins1=createdata2(newfrom,newto);
                insert(listnewedge,toins1);
            }
            pWalker=pWalker->next;
        }
        printlist2(listnewedge);

    }
}