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-fundamentals/?referralCode=DA09C6F40CEC38C942F6

- Python 3 Deep Dive (Part 1 - Functional)
https://www.udemy.com/course/python-3-deep-dive-part-1/?referralCode=E46B931C71EE01845062

- Python 3 Deep Dive (Part 2 - Iteration, Generators)
https://www.udemy.com/course/python-3-deep-dive-part-2/?referralCode=3E7AFEF5174F04E5C8D4

- Python 3 Deep Dive (Part 3 - Hash Maps)
https://www.udemy.com/course/python-3-deep-dive-part-3/?referralCode=C5B0D9AB965B9BF4C49F

- Python 3 Deep Dive (Part 4 - OOP)
https://www.udemy.com/course/python-3-deep-dive-part-4/?referralCode=3BB758BE4C04FB983E6F