Idiomatic Python: Deques vs Lists
In this video we look at the major performance impact of using a list for inserting or deleting elements at the beginning of the list (like trying to use a list as a queue, which needs elements inserted at the front of the list, and removed from the end of the list). A better alternative is using a data structure called a deque (double-ended queue).
00:00 - Introduction
01:49 - Timing List Insertions/Deletions
04:51 - Deques
06:56 - Unbound Deques and Operations
11:49 - Bounded Deques
13:33 - Timing Deques vs Lists
16:45 - Conclusion
#mathbyteacademy #python
Code for this Video
================
Available in GitHub blog repo: https://github.com/fbaptiste/python-blog
Direct link: https://tinyurl.com/rtcf4h93
My Python Courses
=================
Python 3 Fundamentals (introduction to Python)
https://www.udemy.com/course/python3-...
Python 3 Deep Dive (Part 1 - Functional)
https://www.udemy.com/course/python-3...
Python 3 Deep Dive (Part 2 - Iteration, Generators)
https://www.udemy.com/course/python-3...
Python 3 Deep Dive (Part 3 - Hash Maps)
https://www.udemy.com/course/python-3...
Python 3 Deep Dive (Part 4 - OOP)
https://www.udemy.com/course/python-3...
On this page of the site you can watch the video online Idiomatic Python: Deques vs Lists with a duration of hours minute second in good quality, which was uploaded by the user MathByte Academy 06 July 2023, share the link with friends and acquaintances, this video has already been watched 1,207 times on youtube and it was liked by 89 viewers. Enjoy your viewing!
