A sorting algorithm is an algorithm that puts
elements of a list in a certain order. The most-used orders are
numerical order and lexicographical order.
Numerical Order: A numeric order is a way to arrange a sequence of numbers and can be either ascending or descending.
Lexicographical order: In mathematics, the lexicographic or lexicographical order (also known as lexical order, dictionary order, alphabetical order or lexicographic(al) product) is a generalization of the way the alphabetical order of words is based on the alphabetical order of their component letters. Ex:
![{\displaystyle [0,0,2]<[0,1,1]<[0,2,0]<[1,0,1]<[1,1,0]<[2,0,0].}](https://wikimedia.org/api/rest_v1/media/math/render/svg/e8c18c4bd7aa417d12d314de73cfe539aeed8c0a)
Numerical Order: A numeric order is a way to arrange a sequence of numbers and can be either ascending or descending.
No comments:
Post a Comment