An Algorithm is said as Complete algorithm if____________

An algorithm is said to be a complete algorithm if it finds a solution, given that one exists, in a finite amount of time. This means that the algorithm is guaranteed to produce a result for any given input within a certain time frame. This is an important characteristic for algorithms used in real-world applications where a solution is needed promptly.