What is the time complexity of string slice? O(k) or O(n)

able-leopard :

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!

Jacques Gaudin :

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;

Guess you like

Origin http://10.200.1.11:23101/article/api/json?id=397612&siteId=1

What is the time complexity of string slice? O(k) or O(n)

The time complexity of O

What is the Big-O Time complexity of this recursive call with a for-loop

What is time complexity and space complexity

Single chain reverse time complexity of O (n)

Linked list merge (time complexity O(n))

Numbers that disappear (requires time complexity O(N))

Algorithm with O(logn) time complexity

On String Operation Time Complexity

On String Operation Time Complexity

what is time complexity

Big O time complexity and time complexity of the Python built-in functions

What is the time complexity? What is the space complexity?

Time complexity T(n) = O( f(n)) and space complexity S(n) = O( f(n))

why the time complexity of 2 for loops is not O(n2^n)?

Why is the time complexity of 2 for loops not O(n*2^n)?

An Algorithm for the Subset Sum Problem with O(2ⁿ) Time Complexity and O(n) Space Complexity

Simple Time Complexity Big O Notation

Why is deletion of an item at end of Dynamic array O(n) time complexity?

Appreciated that the time complexity of the algorithm, O (1), O (n), O (log2n), O (n ^ 2)

Appreciated that the time complexity of the algorithm, O (1), O (n), O (log2n), O (n ^ 2)

Appreciated that the time complexity of the algorithm, O (1), O (n), O (log2n), O (n ^ 2)

Why lookup based fast discharge of large numbers of k time complexity is O (n)

Leetcode Interview Question 50. The first character that appears only once [time complexity is O (n), space complexity is O (26)]

[Smart Solution] Count the number of occurrences of each element of an unordered array - time complexity O(n), space complexity O(1)

Given an array of 0, 1, 2, arrange 0, 1, 2 in order, the space complexity is O(1), and the time complexity is O(n)

[Algorithm] Sorting Time Complexity of String Arrays

What is the time complexity of Java StringTokenizer.countTokens()

[Data structure] Algorithm efficiency, time complexity, space complexity, big O asymptotic method

Why is the time complexity of the order of the hash table is a constant O (1)