计算机组成原理证明一个关系是函数

1. For a relation, write a method to determine if the relation is a function. The signature of the method is as follows:Int isFunction(int domainSpace[], int rangeSpace[], int domain[], int range[])

Code:

#include<stdio.h>

#include<stdlib.h>

#include<string.h>

int main()

{

    char domainSpace[199],rangeSpace[199],domain[199],range[199],s;

    int a,i,j,t=1;

    scanf("%s",domainSpace);scanf("%s",rangeSpace);

    scanf("%s",domain);scanf("%s",range);

    a=strlen(domain)-2;//两位数占的占的长度和一位数不一样，第2个元素下标为1

    if(strcmp(domainSpace,domain)!=0)t=0;

      else

   

        for(i=0;i<a-1;i++)

        {

            for(j=0;j<a-i-1;j++)

            {

                if(domain[j]>domain[j+1])

                {

                    s=domain[j];domain[j]=domain[j+1];domain[j+1]=s;

   s=range[j];range[j]=range[j+1];range[j+1]=s;            }

            }

        }

            for(j=0;j<a;j++)

            {

                if(domain[j]==domain[j+1]&&range[j]!=range[j+1])

                    t=0;

            }

    if(t==1)

        printf("yes");

    else printf("no");

    return 0;

 

}