Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | An approximate location is interpolated from the first and last items of a sorted array, then a linear search finds the actual location. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)49 4E 54 45 52 50 4F 4C 41 54 49 4F 4E 2D 53 45 51 55 45 4E 54 49 41 4C 53 45 41 52 43 48 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001001 01001110 01010100 01000101 01010010 01010000 01001111 01001100 01000001 01010100 01001001 01001111 01001110 00101101 01010011 01000101 01010001 01010101 01000101 01001110 01010100 01001001 01000001 01001100 00100000 01010011 01000101 01000001 01010010 01000011 01001000 |
HTML Code (1990) (references)I N T E R P O L A T I O N - S E Q U E N T I A L   S E A R C H |
ISO 10646 (1991-1993) (references)0049 004E 0054 0045 0052 0050 004F 004C 0041 0054 0049 004F 004E 002D 0053 0045 0051 0055 0045 004E 0054 0049 0041 004C 0053 0045 0041 0052 0043 0048 |
Encryption (beginner's substitution cypher): (references)4348543952504946355443494815533951553948544335462533935523742 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
