Skip to search formSkip to main contentSkip to account menu

Sorting algorithm

Known as: Sorting Algorithms, Sorted list, Stable sort 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Software clones have been widely studied in the recent literature and shown useful for finding bugs because inconsistent changes… 
2012
2012
A combination of multiple gravity-assist and impulsive V maneuvers are often utilized for interplanetary missions to outer… 
2011
2011
The Single-Chip Cloud Computer (SCC) is an experimental processor created by Intel Labs. It comprises 48 x86 cores linked by an… 
2008
2008
The paper presents the features and samples of use of the optimization by indices module implemented in the ODRA (Object Database… 
2005
2005
Compilers employ system models, sometimes implicitly, to make code optimization decisions. These models are analytic; they… 
1998
1998
In this paper we conduct an in-depth study of the communication costs of programs when run on a typical Symmetric MultiProcessor… 
1997
1997
The paper considers the role of the sorting process in the well-known "neural gas" model for vector quantization. Theoretical… 
1989
1989
Sorting, duplicate suppression and grouping are important operations in relational database management systems. This paper is… 
1989
1989
External sorting is frequently used b>relational database s!-stems for building indexes on tables, ordered retrieval, duplicate… 
1983
1983
A hardware sorter suitable for VLSI implementation is proposed. It operates in a parallel and pipelined fashion, with the actual…