Premium
On sorting and counting
Author(s) -
Heal J. G. B.
Publication year - 1981
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380110812
Subject(s) - sort , subsequence , sorting , computer science , field (mathematics) , key (lock) , sorting algorithm , integer (computer science) , arithmetic , mathematics , algorithm , computer security , pure mathematics , programming language , bounded function , mathematical analysis
When performing an external sort, an extra integer field added to the sort key can be used to count subsequences, and make the counts available at the beginning of each subsequence.