How can I improve performance using iterators in Python?

How can I improve performance using iterators in Python?

You can improve performance by using generators instead of lists, as they yield items one at a time and save memory.

Can you give me an example of a generator in Python?

Sure! Here's a simple generator that yields squares of numbers:

def square_generator(n):
    for i in range(n):
        yield i ** 2

How does this compare to using a list comprehension?

Using a list comprehension would create the entire list in memory at once, while the generator yields one item at a time, which is more memory efficient.

Are there any performance benchmarks comparing the two?

Yes, generally, generators can be significantly faster and use less memory for large datasets, especially when you only need to iterate through the data once.