Assume that we are given \'n\' objects and a subroutine that takes two inputs and says if they are equivalent or not (e.g. it can give output as 1 if they are equal).
Considering that the sequence is ordered you can use binary search, which takes O(log n), and since you'll have to do it for every element, and you have n elements it will take O(n*log n).