Time complexity of Python's collections.deque() non-empty constructor

Asked Oct 17 '22 at 02:24

Active Oct 17 '22 at 02:32

Viewed 66 times

I checked the deque section of the Python Time Complexity Wiki, but I couldn't find the average case and the amortized worst case time complexity of the non-empty deque constructor.

What would be the the average case and amortized worst case time complexity of the examples below?

Example 1

from collections import deque

answer = deque([[1, 4], [3, 9], [0, 2, 1], [3]])

Example 2

from collections import deque

def myfunc(mylist):
    res = []
    for i in mylist:
        res.append(deque(mylist))
    return res

answer = myfunc([[1, 4], [3, 9], [0, 2, 1], [3]])

edited Oct 17 '22 at 02:32

asked Oct 17 '22 at 02:24

croatoan

3

`deque` calls `deque.extend` internally for initialization. Please refer to `extend` for time complexity. – Mechanic Pig Oct 17 '22 at 02:30
[time-complexity-of-random-access-in-deque-in-python](https://stackoverflow.com/questions/39522787/time-complexity-of-random-access-in-deque-in-python) – Mohamad Ghaith Alzin Oct 17 '22 at 02:33
[Mechanic Pig](https://stackoverflow.com/users/17980931) That helps; thanks! – croatoan Oct 17 '22 at 02:37

Time complexity of Python's collections.deque() non-empty constructor

0 Answers0