# Grover algorithm for more than one element

I am currently working on the Grover algorithm again. In many lectures and documents, as well as books, I noticed that there is always talk of looking for a single element of $$N$$ elements. Now I read to Nielsen that Grovers algorithm can also be used for multiple searches. For example if you are looking for $$M>1$$ elements from $$N$$

Now comes the problem, in Nielsen is e.g. said that the process does not change fundamentally. I tried an example by looking for a single element, you can see the result here, I have successively applied the individual steps of the algorithm:

Searched item: $$|01\rangle$$

Input: $$|00\rangle$$