|
Definition of Sorting algorithm
1. Noun. An algorithm for sorting a list.
Definition of Sorting algorithm
1. Noun. (computing) A special algorithm that sorts an array or list of objects. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Sorting Algorithm
Literary usage of Sorting algorithm
Below you will find example usage of this term as found in modern and/or classical literature:
1. SAS(R) 9.1 Companion for UNIX Environments by Institute SAS Institute, SAS Institute (2004)
"You can use this sorting application as an alternative sorting algorithm to the
SAS sort. SAS determines which sort to use by the values that are set for ..."
2. Partial Evaluation and Automatic Program Generation by Neil D. Jones, Carsten K. Gomard, Peter Sestoft (1993)
"This problem is entirely due to non-obliviousness of the sorting algorithm.
It leads directly to the question: does there exist a comparison-optimal weakly ..."
3. SAS(R) 9.1 Companion for Windows by SAS Institute (2004)
"... With SAS If you have SyncSort installed at your site, you can use Syncsort as
an alternative sorting algorithm to the database sort or the SAS sort. ..."
4. SAS/ACCESS(R) 9.1.3 for Relational Databases:: Reference, Third Edition by SAS Publishing (CRT), SAS Institute (2006)
"(Sorting uses the first available and pertinent sorting algorithm in this list.)
This is the default. ..."
5. Geometric Computing Science: First Steps by Robert Hermann (1991)
"A trajectory system for a sorting algorithm of the set S with a given key K is
defined by the following data: (a) A subset U of the permutation group G of ..."
6. Role of Farm-Level Diversification in the Adoption of Modern Technology in by Marc Nerlove, Stephen Vosti, Wesley Basel (1996)
"Rather, the centroid sorting algorithm is repeated several times, using two
different types of initial centroids. Given K clusters, the first type of ..."
7. Concrete Abstractions: An Introduction to Computer Science Using Scheme by Max Hailperin, Barbara Kaiser, Karl Knight (1999)
"This difference makes merge sort a decidedly superior sorting algorithm; we'll
return to it in Chapter 7, when we have the apparatus needed to program it in ..."