Some algorithms contain parameters in their running time that actually correspond to their solutions. For example, the vertex cover is fixed-parameter tractable for size k of the cover- the running time is expressed in terms of k rather than n.

If we implement awareness of its own running time into such an algorithm, we can use this to easily determine the solution.