Algorithm

banana problem

The Velvet Underground & Nico album cover Image via Wikipedia

banana problem

[from the story of the little girl who said "I know how to spell 'banana', but I don't know when to stop"]. Not knowing where or when to bring a production to a close (compare {fencepost error}). One may say there is a banana problem of an algorithm with poorly defined or incorrect termination conditions, or in discussing the evolution of a design that may be succumbing to featuritis (see also {creeping elegance}, {creeping featuritis}). See item 176 under HAKMEM, which describes a banana problem in a {Dissociated Press} implementation. Also, see {one-banana problem} for a superficially similar but unrelated usage.





Related articles by Zemanta

Marcadores: , , , , , ,



# 5/19/2009 11:31:00 AM, Comentários, Links para esta postagem,

naive

naive

  1. Untutored in the perversities of some particular program or system; one who still tries to do things in an intuitive way, rather than the right way (in really good designs these coincide, but most designs aren't `really good' in the appropriate sense). This trait is completely unrelated to general maturity or competence, or even competence at any other specific program. It is a sad commentary on the primitive state of computing that the natural opposite of this term is often claimed to be experienced user but is really more like cynical user.
  2. Said of an algorithm that doesn't take advantage of some superior but advanced technique, e.g., the {bubble sort}. It may imply naivete on the part of the programmer, although there are situations where a naive algorithm is preferred, because it is more important to keep the code comprehensible than to go for maximum performance. "I know the linear search is naive, but in this case the list typically only has half a dozen items." Compare {brute force}.

Reblog this post [with Zemanta]

Marcadores: , , ,



# 5/13/2009 12:31:00 PM, Comentários, Links para esta postagem,