Removes the element at the specified position in this set.
Removes the element at the specified position in this set.For hash sets removing from a position of the set has a time complexity of O(N), with N being the capacity of the set.
For tree sets removing from the beginning or the end of the set has a time complexity of O(Log N), while removing from a random position in the middle of the set has a time complexity of O(N), with N being the number of elements in the set.