Programming Fundamentals/Sorting Arrays
A sorting algorithm is an algorithm that puts elements of a list in a certain order. The most frequently used orders are numerical order and lexicographical order. Most current programming languages include built-in or standard library functions for sorting arrays.
Sorting is the process through which data are arranged according to their values. The following examples show standard library and/or built-in array sorting methods for different programming languages.
|Language||Reverse Sort Example|
- Arranging data according to their values.