I am studying algorithms in my data structures class, and have the following question

How many comparisons are necessary to find the largest and smallest of a set of n distinct elements?

It seems incomplete, as I thought that the computational complexity represented the number of comparisons, but this value varies from algorithm to algorithm.