Pythonic FuncProg: List comprehensions
summary
Shows concrete code that computes squares up to 10 to the 8, compares a for-loop, map/filter and list comprehensions, and measures runtimes: map is slowest, for-loop ~12s (11.5s in a later run) and list comprehension ~10s (8.7s in the filtered case). Demonstrates equivalent patterns: map/filter replacement, flattening nested lists and filtering sublists by length>1, all working as shown; code and examples live at https://github.com/mftb/pythonic-functional-programming.
AI-written summary · about
chapters (11)
- 0:00Pythonic functional programming
- 1:04Iterative squares
- 3:20Using map
- 5:10List comprehensions
- 7:50Benchmarking performance
- 8:33Filtering with functional programming
- 10:23List comprehensions filtering
- 11:29Flattening nested lists
- 12:33Advanced filtering
- 13:37Performance benefits
- 14:20Closing
related talks
19mPython - best practices
07mOptimizing with list comprehensions
01h 12mFurious & Fast Python 7: Writing Fast Python Code
29mI wish I learnt that earlier!
21mBecome a Better Pythonista by Abusing List Comprehensions and :=
30mWrite faster Python! Common performance anti patterns
36mHow to Optimize your Python Program for Slowness
30mFunctional Programming in Python