Collation

Collation is the assembly of written information into a standard order. Many systems of collation are based on <a href="/facts/Number/auQSAE2m">numerical order</a> or <a href="/facts/Alphabetical_order/oKu6Ke37">alphabetical order</a>, or extensions and combinations thereof. Collation is a fundamental element of most office <a href="/facts/Library_classification/7saMUXAH">filing systems</a>, <a href="/facts/Library_catalog/mk474y74">library catalogs</a>, and <a href="/facts/Reference_book/7Fq2pIYG">reference books</a>.
Collation differs from <a href="/facts/Classification_(general_theory)/6lKjA7pF">classification</a> in that the classes themselves are not necessarily ordered. However, even if the order of the classes is irrelevant, the identifiers of the classes may be members of an ordered set, allowing a <a href="/facts/Sorting_algorithm/PwHpj1Gs">sorting algorithm</a> to arrange the items by class.
Formally speaking, a collation method typically defines a <a href="/facts/Total_order/xnTtmuYJ">total order</a> on a set of possible identifiers, called sort keys, which consequently produces a <a href="/facts/Total_preorder/LmaM9lSs">total preorder</a> on the set of items of information (items with the same identifier are not placed in any defined order).
A collation algorithm such as the <a href="/facts/Unicode_collation_algorithm/4VydIteq">Unicode collation algorithm</a> defines an order through the process of comparing two given <a href="/facts/Character_string/4ChJu5WS">character strings</a> and deciding which should come before the other. When an order has been defined in this way, a sorting algorithm can be used to put a list of any number of items into that order.
The main advantage of collation is that it makes it fast and easy for a user to find an element in the list, or to confirm that it is absent from the list. In automatic systems this can be done using a <a href="/facts/Binary_search_algorithm/FFmQzunc">binary search algorithm</a> or <a href="/facts/Interpolation_search/nRtGvK4u">interpolation search</a>; manual searching may be performed using a roughly similar procedure, though this will often be done unconsciously. Other advantages are that one can easily find the first or last elements on the list (most likely to be useful in the case of numerically sorted data), or elements in a given range (useful again in the case of numerical data, and also with alphabetically ordered data when one may be sure of only the first few letters of the sought item or items).

Collation open-in-new

Collation