Key Indexed Counting
Key Indexed Counting Key indexed counting is a stable linear time sorting method for items with small integer keys. It generalizes counting sort by separating keys from records and placing records directly into their correct index range. This form is widely used in string sorting and radix-based pipelines. Problem Given an array $A$ of records, where each record has a key in range $[0, k)$, reorder the array so that...