- 1. Improving Performance - Optimizing code
- 1.1. Problems
- 1.2. Optimization strategy
- 1.3. Locate the source of the problem
- 1.4. Optimizing tactics
- 1.5. DSU: Decorate Sort Undecorate
- 1.6. Profile code
- 1.7. Slow example
- 1.8. profile slow code
- 1.9. cProfile slow code
- 1.10. Benchmarking
- 1.11. Benchmarking subs
- 1.12. Counting words - which implementation is faster?
- 1.13. for loop or reduce to add numbers?
- 1.14. Levenshtein distance
- 1.15. Generate words
- 1.16. Levenshtein - pylev
- 1.17. Levenshtein - editdistance
- 1.18. Editdistance benchmark
- 1.19. A Tool to Generate text files
- 1.20. Count characters
- 1.21. Memory leak
- 1.22. Garbage collection
- 1.23. Weak reference
- 1.24. Exercise: benchmark list-comprehension, map, for
- 1.25. Exercise: Benchmark Levenshtein
- 1.26. Exercise: sort files
- 1.27. Exercise: compare split words:
- 1.28. Exercise: count words