How to determine the time complexity of the operation of removing an element from a slice type array?

In Go, a slice is a structure that contains a pointer to an array, a length, and a capacity. When removing an element from a slice, it is usually necessary to shift all subsequent elements one position to the left to fill the "gap".

The time complexity of such an operation is O(n), where n is the number of elements after the removed element. This is because it requires copying (n - index_of_removed_element - 1) elements.

Example of removing an element by index:

func remove(slice []int, i int) []int {
    return append(slice[:i], slice[i+1:]...)
}

Here, append copies elements from slice[i+1:] into the position after slice[:i], which takes linear time proportional to the number of elements being copied.