Encyclopedia > Bulletproof algorithm

  Article Content

Bulletproof algorithm

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.



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
U.S. presidential election, 1804

... Mate(Electoral Votes) Thomas Jefferson (W) 162 Democratic-Republican George Clinton (162) Charles C. Pinckney[?] 14 Federalist Rufus King ...

 
 
 
This page was created in 27.8 ms