Bulletproof Algorithm

The term "bulletproof algorithm" is often applied to algorithms or implementations considered extremely robust — lossless-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.

See also

*Exception handling

 

<< PreviousWord BrowserNext >>
basque people
blot
bzier curve
banach algebra
b star algebra
boris pasternak
binomial coefficient
bill holbrook
bruce campbell
baron aberdare
boy band
b tree
british museum
bloody sunday
binomial theorem
bitmap font
balboa
boxing day
balochistan
balochistan, pakistan
boss tweed
balsall heath
bunge y born
big apple
boston corbett
berber languages
bankruptcy
blissymbols
bessel function
backpacking
brahui language
benjamin tucker
berkeley db
battle of grunwald
battle of tannenberg
boolean satisfiability problem
bohemian
bob jones university
british empire
batman (1989 movie)
batman (1966 movie)
batman returns
batman and robin (1997 movie)
batman forever