The search task is one of the most difficult when it comes to execution speed, and reducing the latter is important both when working with large data and with small samples, if they need to be processed frequently and in a limited time. Grover''s algorithm gave hope to quantum computing and served as an excellent base for all possible implementations and modifications. In this paper, we propose a slightly different algorithm that increases the probability of finding the nearest value by reducing the probability of undesirable values in a controlled manner (in proportion to their difference from the desired value), as well as implementing an oracle that requires a single call without an additional ancilla qubit to redistribute the amplitudes.