I'm trying to prove this problem:

> 
> if an algorithm exists that can determine if a sorted list of n
>  elements has duplicate elements in it, than the number of comparisons
>  needed has a lower bound of `n-1`.
> 
> 
> 

I'm not quite familiar with lower and higher bounds and I seem to confuse it, can someone help me with an easy to understand proof?