This work presents a comparative analysis of successive approximation algorithms with ordinary algorithms under fault injection. Successive approximation algorithms are implemented as a computation loop that approaches the final result for each loop execution. Because of that, we expect that they will present a natural fault tolerance, given that a fault in a given point of the execution may be masked in the next computation loops. This work will evaluate their behavior under simulated fault injection, and executing bare metal and on top of FreeRTOS and Linux operating systems. Results show that successive approximation algorithms presents less silent data corruption errors than most ordinary algorithms, while maintaining the same occurrence of hang errors.