High Quality Content by WIKIPEDIA articles! In computer science an anytime algorithm is an algorithm that can return a valid solution to a problem even if it`s interrupted at any time before it ends. The algorithm is expected to find better and better solutions the more time it keeps running.