Write a computer algorithm to check whether a function from one finite set to another is one-to-one. Assume the existence of an independent algorithm to compute values of the function.

To find:

A computer algorithm for checking whether a function from one finite set to another is one-to-one.

Given information:

Assume that the existence of an independent algorithm for computing values of the function.

Concept used:

One-to-one function: The distinct elements in domain are mapped with distinct elements in co-domain.

Onto function: Every element in co-domain must be mapped with the element in domain.

Calculation:

Suppose X={x1,x2,.....,xn} and Y={y1,y2,......,ym}

Then f:X→Y is one-to-one if and only if

f(xi)=f(xj) Such that xi≠xj

Domain of f: one dimensional array a[1],a[2],.....,a[n]

Introduce a new variable: answer