Make deletions in arrays blazingly fast

If we want to delete an item from an array at a random position without changing the order of items in the array, the time complexity of such operation would be linear, O(N) for traversal + additional O(N) for shifting all the items after the deleted...