To underscore the point: The Python code snippet del a[i] deletes the element at index i from a list a. This code certainly is quite readable, but not so tra

To underscore the point: The Python code snippet del a[i] deletes the element at index i from a list a. This code certainly is quite readable, but not so transparent: it’s easy to miss that the time complexity is O(n), where n is the number of elements in the list. Go doesn’t have a similar utility function. This is definitely less convenient, but also more transparent. Your code needs to explicitly state if it copies a section of the list. See 2 ways to delete an element from a slice for a Go code example. I think this assertion is wrong. del in python does exactly what it says it does. There are precisely three reasons to not use del: o Because you have written your program, got all the low hanging performance fruits, and now need to optimise how you delete from (large) lists, and dequeue doesn't work for you o you are arrogant and want to show everyone how clever you are because you understand how list operation are handled under the hood. So you have written your own. o a.remove()/a.pop() you think is more readable. It is far more important to be readable than to be fast in 90% of cases. If we all really cared about speed, then React/electron/et al would never be a thing.