bubble sort n.
Techspeak for a particular sorting
technique in which pairs of adjacent values in the list to be
sorted are compared and interchanged if they are out of order;
thus, list entries `bubble upward' in the list until they bump
into one with a lower sort value. Because it is not very good
relative to other methods and is the one typically stumbled on by
naive and untutored programmers, hackers consider it the
canonical example of a naive algorithm. (However, it's been
shown by repeated experiment that below about 5000 records
bubble-sort is OK anyway.) The canonical example of a really
bad algorithm is bogo-sort. A bubble sort might be
used out of ignorance, but any use of bogo-sort could issue only
from brain damage or willful perversity.
Techspeak for a particular sorting
technique in which pairs of adjacent values in the list to be
sorted are compared and interchanged if they are out of order;
thus, list entries `bubble upward' in the list until they bump
into one with a lower sort value. Because it is not very good
relative to other methods and is the one typically stumbled on by
naive and untutored programmers, hackers consider it the
canonical example of a naive algorithm. (However, it's been
shown by repeated experiment that below about 5000 records
bubble-sort is OK anyway.) The canonical example of a really
bad algorithm is bogo-sort. A bubble sort might be
used out of ignorance, but any use of bogo-sort could issue only
from brain damage or willful perversity.
Related:
- bubble sort: n. Techspeak for a particular sorting technique in
which pairs of adjacent values in the list to be sorted are
compared and interchanged if they are out of orde
hus, list entries `bubble upward' in the list until they bump into one with a lower sort value.... - bogo-sort: /boh`goh-sort'/ n. (var. `stupid-sort') The
archetypical perversely awful algorithm (as opposed to {bubble
sort}, which is merely the generic *bad* algorithm).
Bogo-sort is equivalent to repeatedly throwing a deck of cards in the air, picking them up at random, and then testing whether they are in order.... - bogo-sort /boh`goh-sort'/ n.
(var. `stupid-sort')
The archetypical perversely awful algorithm (as opposed to
bubble sort, which is merely the generic bad
algorithm).
Bogo-sort is equivalent to repeatedly throwing a deck of cards in the air, picking them up at random, and then testing whether they are in order.... - aive adj.
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).... - brute force adj.
Describes a primitive programming style
one in which the programmer relies on the computer's processing power instead of using his or her own intelligence to simplify the problem, often ignoring problems of scale and applying naive methods suited to small problems directly to large ones.... - upid-sort n. Syn. bogo-sort.
- brute force and ignorance: n. A popular design technique at many
software houses -- {brute force} coding unrelieved by any
knowledge of how problems have been previously solved in elegant
ways.
Dogmatic adherence to design methodologies tends to encourage this sort of thing.... - upid-sort: n. Syn. {bogo-sort}. -- The AI Hackers Dictionary
- 0055 Did you ever optimize a bubble sort? -- from THE HACKER TEST
