The time complexity be for the add operation on an array implementation of a set would be O(_____) if there were not a count variable in the implementation.
A) Log n
B) n
C) n log n
D) none of the above

Question

Quizplus · Accepted Answer

Adding an element to an array-based set without a count variable (assuming no duplicates are allowed and the set is unordered) involves checking each element to ensure the new element is not already present, which takes O(n) time in the worst case, where n is the number of elements in the set.

The Time Complexity Be for the Add Operation on an Array