Computational complexity of `BiobjectiveNondominatedSortedList.__init__` with the number of dominated points

[nikohansen]

Since 5a21063, BiobjectiveNondominatedSortedList creates its list first and only then prunes it. As pruning is $\cal O(n)$ for each pruned element (as suggested in this now deleted comment),

                    self.append(f_pair)  # this is O(1) whereas prune is O(n) for each pruned element

this makes the constructor $\cal O(n^2)$ when a constant fraction of points is dominated whereas it was $\cal O(n)$ before?