The running time for the ____ method is O(1) for Array implementation. Question 12 options: __str__ __getitem__(index) pop(index) insert(index, item)
The running time for the ____ method is O(1) for Array implementation.
Question 12 options:
|
|
__str__ |
|
|
__getitem__(index) |
|
|
pop(index) |
|
|
insert(index, item) |
In insert(index, item) method, the pointer traverse from 0th position to specified index and then the element is inserted at that index and as it involved checking each element its complexity is of order O(n)
In pop(index) method, the pointer is traversed to that index and then the element is deleted and as it involved checking each element its complexity is of order O(n)
In __getItem__(index method), the pointer traverse from 0th position to specified index and then the element is at that index is returned and as it involved checking each element its complexity is of order O(n)
The general implementation of __str__ method is to represent the object in a meaningful way and it simply returns a string and it is a single step and thus complexity is of order O(1)
Step by step
Solved in 2 steps
