How do generators perform compared to lists in Python?

How do generators perform compared to lists in Python?

Generators are more memory efficient than lists because they yield items one at a time and do not store the entire sequence in 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

You can use it like this:

for square in square_generator(5):
    print(square)

What are the advantages of using generators?

Generators provide several advantages: they save memory, allow for lazy evaluation, and can represent infinite sequences.

Are there any downsides to using generators?

Yes, the main downside is that generators can only be iterated once. Once you exhaust them, you need to recreate them to iterate again.