Main Page | See live article | Alphabetical index The term "bulletproof algorithm" is often applied to algorithms or implementations considered extremely robust—lossage-resistant and capable of correctly recovering from any imaginable exception condition—a rare and valued quality. The term implies that the programmer has thought of all possible errors, and added code to protect against each one. Thus, in some cases, this can imply code that is too heavyweight, due to excessive paranoia on the part of the programmer. This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License.