Alphabetical order

Alphabetical configuration is a system whereby character strings are placed in layout based on the position of the characters in the conventional ordering of an alphabet. this is the one of the methods of collation. In mathematics, a lexicographical order is the generalization of the alphabetical order to other data types, such(a) as sequences of numbers or other ordered mathematical objects.

When applied to strings or sequences that may contain digits, numbers or more elaborate line of elements, & alphabetical characters, the alphabetical order is generally called a lexicographical order.

To creation which of two strings of characters comes number one when arranging in alphabetical order, their first letters are compared. if they differ, then the string whose first letter comes earlier in the alphabet comes ago the other string. whether the first letters are the same, then theletters are compared, as living as so on. If a position is reached where one string has no more letters to compare while the other does, then the first shorter string is deemed to come first in alphabetical order.

Capital letters upper effect are broadly considered to be identical to their corresponding lower case letters for the purposes of alphabetical ordering, although conventions may be adopted to handle situations where two strings differ only in capitalization. Various conventions also equal for the handling of strings containing spaces, modified letters such as those with diacritics, & non-letter characters such(a) as marks of punctuation.

The a thing that is said of placing a rank of words or strings in alphabetical order is that all of the strings beginning with the same letter are grouped together; within that grouping any words beginning with the same two-letter sequence are grouped together; and so on. The system thus tends to maximize the number of common initial letters between adjacent words.


Collation algorithms in combination with sorting algorithms are used in computer programming to place strings in alphabetical order. A specifications example is the Unicode Collation Algorithm, which can be used to include strings containing any Unicode symbols into an address of alphabetical order. It can be produced to conform to near of the language-specific conventions identified above by tailoring its default collation table. Several such tailorings are collected in Common Locale Data Repository.