Schlemiel the Painter's algorithm: Difference between revisions

Revision as of 13:29, 11 February 2014

Revision as of 16:13, 21 February 2014

Line 1:

{{afd-mergeto|Joel Spolsky|Schlemiel the Painter's algorithm|21 February 2014}}

<!-- Please do not remove or change this AfD message until the issue is settled -->

{{Article for deletion/dated|page=Schlemiel the Painter&#39;s algorithm|timestamp=20140211132922|year=2014|month=February|day=11|substed=yes}}

<!-- For administrator use only: {{Old AfD multi|page=Schlemiel the Painter&#39;s algorithm|date=11 February 2014|result='''keep'''}} -->

<!-- End of AfD message, feel free to edit beyond this point -->

{{Distinguish|Painter's algorithm}}

In software development, a '''Schlemiel the Painter's algorithm''' (or '''Schlemiel the Painter algorithm''')<!-- Spolsky uses it both with and without the possessive 's --> is a method that is inefficient because the programmer has overlooked some fundamental issues at the very [[High and low level|lowest levels]] of [[software design]]. The term was coined in 2001 by software engineer and essayist [[Joel Spolsky]].