Classical algorithms in C++: with new approaches to sorting, searching, and selection
Classical algorithms in C++: with new approaches to sorting, searching, and selection
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
ACM Computing Surveys (CSUR)
Programming pearls: how to sort
Communications of the ACM
Parallel Sorting Algorithms
Pascalorithms
| Hi-index | 0.00 |
In computing, sorting is the process of rearranging an initially unordered sequence of records until they are ordered with respect to all of or that part of each record designated as its key. Usually, the desired result is that the records be placed in ascending order (smallest key first), but any sorting algorithm capable of placing records in ascending order can be easily modified to produce a sequence of records in descending order.