在无序数组中，删除元素O（n）的时间复杂度吗？

Question

I read somewhere that it is O(1). However, if we need to remove an element from an array we need to swap all the elements to the left and in the worst case wont will it need to make N swaps which makes the complexity O(n)? I am confused?! Also is there a difference between an unordered and an unsorted array??

Answer 1

由于数组是无序的，因此您可以用最后一个元素填充孔，然后将数组缩短1。无需将每个元素向下移动一个位置。

Answer 2

根据要删除元素的方式（即通过提供元素的索引或值），它是O(1)或O(n) 。