Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | The highest possible use of resources of an algorithm, which occurs for the most pessimistic, or worst possible, input. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)57 4F 52 53 54 2D 43 41 53 45 4D 49 4E 49 4D 55 4D 41 43 43 45 53 53 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010111 01001111 01010010 01010011 01010100 00101101 01000011 01000001 01010011 01000101 00100000 01001101 01001001 01001110 01001001 01001101 01010101 01001101 00100000 01000001 01000011 01000011 01000101 01010011 01010011 |
HTML Code (1990) (references)W O R S T - C A S E   M I N I M U M   A C C E S S |
ISO 10646 (1991-1993) (references)0057 004F 0052 0053 0054 002D 0043 0041 0053 0045 004D 0049 004E 0049 004D 0055 004D 0041 0043 0043 0045 0053 0053 |
Encryption (beginner's substitution cypher): (references)574952535415373553392474348434755472353737395353 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
