Provide a pscuclocode and its complexity for the algorithm that determines whether a function from a finite set of elements to another finite set is a bijcctiou.

(a) Write a fommla for a function which cxprcmcs the number of comparisons done for all the elements from the function domain against the elements from the function codomain in the womt case.

(b) Classify the algorithm using the big—O asymptotic notation.

Answer rating: 100% (QA)

a The number o... View the full answer