字符串切片的时间复杂度是多少？ O(k) 或 O(n)

Question

Is the time complexity of python str slice O(k) or O(n)?

The answers I am reading suggest its O(k) but I don't understand how.

For example

my_str = "thisismystringfortesting"

sub_str = my_str[3:10]

I understand its extracting only (k) characters, but doesn't the operation have to convert the whole string into a list first before the slice? My thought process is that the conversion of the entire string into a list alone would cost O(n). Unless only part of the string gets converted into a list?

So can someone please explain is string slicing on Python O(k) or O(n)?

Thanks so much!

Answer 1

The relevant code is here and it is O(k) as it can be seen line 1628

result_buf = PyBytes_AS_STRING(result);
for (cur = start, i = 0; i < slicelength;cur += step, i++) {
        result_buf[i] = source_buf[cur];
}
return result;