Key Indexed Counting is the basis for many string based sorting algorithms.
In order to sort the strings each one is assigned a key as a piece of metadata. This key must be an integer between and and therefore cane be used as an array index.
Example: Sections
Example: ASCII Table
