Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A variant of bubble sort which compares each adjacent pairs of items in a list in turn, swapping them if necessary, and alternately passes through the list from the beginning to the end then from the end to the beginning until no swaps are done. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)42 49 44 49 52 45 43 54 49 4F 4E 41 4C 42 55 42 42 4C 45 53 4F 52 54 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000010 01001001 01000100 01001001 01010010 01000101 01000011 01010100 01001001 01001111 01001110 01000001 01001100 00100000 01000010 01010101 01000010 01000010 01001100 01000101 00100000 01010011 01001111 01010010 01010100 |
HTML Code (1990) (references)B I D I R E C T I O N A L   B U B B L E   S O R T |
ISO 10646 (1991-1993) (references)0042 0049 0044 0049 0052 0045 0043 0054 0049 004F 004E 0041 004C 0042 0055 0042 0042 004C 0045 0053 004F 0052 0054 |
Encryption (beginner's substitution cypher): (references)364338435239375443494835462365536364639253495254 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
