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.
2013
2013
This paper presents a method for estimating the voltages at the individual sub-module capacitors of Modular Multilevel Converters… 
2007
2007
Scalability is the key issue in making content-based copy de-tection (CBCD) methods practical for very large image and video… 
2005
Highly Cited
1988
Highly Cited
1988
The problems of sorting and routing on n 1×... × n r mesh-connected arrays of processors are studied. A new sorting algorithm for… 
1983
1983
A hardware sorter suitable for VLSI implementation is proposed. It operates in a parallel and pipelined fashion, with the actual… 
Highly Cited
1982
Highly Cited
1982
Highly Cited
1981
Highly Cited
1981
The continuing evolution of microelectronics provides the tools for developing new methods of synthesizing digital images by… 
1979
1979
This paper results from an attempt to unify several different file system design theories. We define a term "partial match… 
Highly Cited
1978
Highly Cited
1978
SummaryWe synthesise versions of six well known sorting algorithms from a common specification using program transformation…