From WikiChip
Editing schlemiel the painter's algorithm
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
This page supports semantic in-text annotations (e.g. "[[Is specified as::World Heritage Site]]") to build structured and queryable content provided by Semantic MediaWiki. For a comprehensive description on how to use annotations or the #ask parser function, please have a look at the getting started, in-text annotation, or inline queries help pages.
Latest revision | Your text | ||
Line 1: | Line 1: | ||
− | |||
'''Schlemiel the Painter's Algorithm''' (also spelled ''Shlemiel'') is a term referring to a class of [[routines]] that may seem to perform well under small workloads but prove to be highly inefficient as they scale due to needlessly redundant operations that are performed at a [[lower level]]. The term was coined by [[Wikipedia:Joel Spolsky|Joel Spolsky]] in late 2001. | '''Schlemiel the Painter's Algorithm''' (also spelled ''Shlemiel'') is a term referring to a class of [[routines]] that may seem to perform well under small workloads but prove to be highly inefficient as they scale due to needlessly redundant operations that are performed at a [[lower level]]. The term was coined by [[Wikipedia:Joel Spolsky|Joel Spolsky]] in late 2001. | ||