What is the main advantage of using a hash set to detect duplicates in a collection compared to sorting first?

A A hash set always uses less total memory than sorting the collection B Sorting guarantees O(n) time, while a hash set requires O(n log n) C A hash set lets you check and record each element in O(1) average time during a single pass, achieving O(n) average time versus the O(n log n) needed to sort first D A hash set automatically removes duplicates from the original array in place