Slices time complexity

[Serhiy Storchaka]

On 19.05.15 12:45, Steven D'Aprano wrote:
> On Tuesday 19 May 2015 05:23, Mario Figueiredo wrote:
>>  From the above link it seems slices work in linear time on all cases.
>
> I wouldn't trust that is always the case, e.g. deleting a contiguous slice
> from the end of a list could be O(1).

It always has linear complexity. You need to decref removed elements.