In algorithms/python, you can use a list to implement a queue (although effeciency is not optimal), and to add an item you do list. [...] , and to delete an item you do list. [...] , one is O(1) while the other is O(n).
^^ NOTE: the two occlusions above are each a different answer!
Answer
list.append(item) to enqueue/add list.pop(0) to dequeue/delete
Question
In algorithms/python, you can use a list to implement a queue (although effeciency is not optimal), and to add an item you do list. [...] , and to delete an item you do list. [...] , one is O(1) while the other is O(n).
^^ NOTE: the two occlusions above are each a different answer!
Answer
?
Question
In algorithms/python, you can use a list to implement a queue (although effeciency is not optimal), and to add an item you do list. [...] , and to delete an item you do list. [...] , one is O(1) while the other is O(n).
^^ NOTE: the two occlusions above are each a different answer!
Answer
list.append(item) to enqueue/add list.pop(0) to dequeue/delete
If you want to change selection, open document below and click on "Move attachment"
pdf
owner: kkhosravi - (no access) - PYTHON_DATA_STRUCTURES_AND_ALGORITHMS.pdf, p135
Summary
status
not learned
measured difficulty
37% [default]
last interval [days]
repetition number in this series
0
memorised on
scheduled repetition
scheduled repetition interval
last repetition or drill
Details
No repetitions
Discussion
Do you want to join discussion? Click here to log in or create user.