Describe an algorithm that determines whether a function from a finite set to another finite set is one-to-one.

Question

Accepted Answer

An algorithm that determines whether a function from a finite set of integers to another finite set of integers is one-to-one, can be given as below:

\user1 procedure one-to-one f ( x ) ( $X = \{x_{1}, x_{2}, . . ., x_{n}\}, y = \{y_{1}, y_{2}, . . . ., y_{m}\}$ : set of integers)

\user1 for $i : = 1$ to m

Algorithm will return true if given function is one-to-one function, otherwise, it will return false.

Short Answer