If the array fits in the cache, deleting from the middle of an array and copying all the subsequent elements one to the left is actually faster than a linked list.
And most arrays fit in the cache.
And most arrays fit in the cache.
However, you're likely right for slices with len < 500 or so due to garbage collector churn on linked lists.