Grover's algorithm, M out of N, when M is large
When $M=N/2$, you don't need a quantum algorithm; a classical algorithm can find a matching entry in $O(1)$ iterations on average (expected running time), just by randomly guessing an item and checking if it matches.  Grover's algorithm is also randomized, so the quantum computer offers no advantage in asymptotic running time for that case.