You don't really need a specific example of an oracle, you can see it as a general property of quantum measurement: you can perform a computation on all basis states in parallel, but measurement restricts the amount of information you get out of that computation.
For the sake of the argument let's say we're looking at an oracle that searches through all 2-bit strings to find one that equals "01".
Let's say you're using a marking oracle, and apply it to 2 qubits in equal superposition and an auxiliary qubit to mark the solution. You get the state that is a superposition of 4 basis states:
$$|00\rangle \otimes |0\rangle + |01\rangle \otimes |1\rangle + |10\rangle \otimes |0\rangle + |11\rangle \otimes |0\rangle$$
Now you need to figure out which of the basis states that are part of this superposition has the last qubit in the $|1\rangle$ state. If you just measure the last qubit, you get only 25% chance of getting the basis state that has 1 in the last bit (and produces the answer), and 75% chance of getting another state that won't produce an answer. It's the same as picking out a random input and checking whether it is the answer to the problem.
In contrast, using Grover's search yields the answer (in this case) after the same 1 iteration with 100% certainty.