Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A balanced k-way merge sort that sorts a data stream using repeated merges. It distributes the input into two streams by repeatedly reading a block of input that fits in memory, a run, sorting it, then writing it to the next stream. It then repeatedly merges the two streams and puts each merged run into one of two output streams until there is a single sorted output. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)42 41 4C 41 4E 43 45 44 54 57 4F 2D 57 41 59 4D 45 52 47 45 53 4F 52 54 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000010 01000001 01001100 01000001 01001110 01000011 01000101 01000100 00100000 01010100 01010111 01001111 00101101 01010111 01000001 01011001 00100000 01001101 01000101 01010010 01000111 01000101 00100000 01010011 01001111 01010010 01010100 |
HTML Code (1990) (references)B A L A N C E D   T W O - W A Y   M E R G E   S O R T |
ISO 10646 (1991-1993) (references)0042 0041 004C 0041 004E 0043 0045 0044 0054 0057 004F 002D 0057 0041 0059 004D 0045 0052 0047 0045 0053 004F 0052 0054 |
Encryption (beginner's substitution cypher): (references)363546354837393825457491557355924739524139253495254 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
