Related:

• ASCIIbetical order /as'kee-be'-t*-kl or'dr/ adj.,n.
  Used to indicate that data is sorted in ASCII collated order rather than alphabetical order....
• 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....
• ASCII /as'kee/ n. [originally an acronym (American Standard Code for Information Interchange) but now merely conventional] The predominant character set encoding of present-day computers.
  The standard version uses 7 bits for each character, whereas most earlier codes (including early drafts of of ASCII prior to June 1961) used fewer....
• crunch: 1. vi. To process, usually in a time-consuming or complicated way.
  Connotes an essentially trivial operation that is nonetheless painful to perform....
• There it was, hidden in alphabetical order. -- Rita Hol
• fence: n. 1. A sequence of one or more distinguished ({out-of-band}) characters (or other data items)
  used to delimit a piece of data intended to be treated as a unit (the computer-science literature calls this a `sentinel')....
• 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
  thus, list entries `bubble upward' in the list until they bump into one with a lower sort value....
• hobbit: n. 1. The High Order Bit of a byte; same as the {meta bit} or {high bit}.
  2. The non-ITS name of vad@ai.mit.edu (*Hobbit*), master of lasers....
• crunch 1. vi. To process, usually in a time-consuming or complicated way.
  Connotes an essentially trivial operation that is nonetheless painful to perform....