Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A sort algorithm that builds a weak-heap, then repeatedly extracts the maximum item. In the worst case, the run time is O(n log n + 0.1 n). (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)57 45 49 47 48 54 2D 42 41 4C 41 4E 43 45 44 54 52 45 45 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010111 01000101 01001001 01000111 01001000 01010100 00101101 01000010 01000001 01001100 01000001 01001110 01000011 01000101 01000100 00100000 01010100 01010010 01000101 01000101 |
HTML Code (1990) (references)W E I G H T - B A L A N C E D   T R E E |
ISO 10646 (1991-1993) (references)0057 0045 0049 0047 0048 0054 002D 0042 0041 004C 0041 004E 0043 0045 0044 0054 0052 0045 0045 |
Encryption (beginner's substitution cypher): (references)573943414254153635463548373938254523939 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
