The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003075 Minimal number of comparisons needed for n-element sorting network.
(Formerly M2446)

%I M2446

%S 0,1,3,5,9,12,16,19,25,29,35,39

%N Minimal number of comparisons needed for n-element sorting network.

%C It is conjectured that the sequence continues (after 39) 45, 51, 56, 60, ...

%C a(13) <= 45 is mentioned in Knuth, Sorting and Searching, Vol. 2. a(9) was determined in 1991. - _Ed Pegg Jr_, Dec 05 2001.

%C Correction: the value for a(9) was not determined in the 1991 reference, which instead is about optimal depth. - _Michael Codish_, Jun 01 2014

%D R. W. Floyd and D. E. Knuth, The Bose-Nelson sorting problem, pp. 163-172 of J. N. Srivastava, ed., A Survey of Combinatorial Theory, North-Holland, 1973.

%D H. Jullie, Lecture Notes in Comp. Sci. 929 (1995), 246-260.

%D D. E. Knuth, Art of Computer Programming, Vol. 3, Sect. 5.3.4, Eq. (11).

%D I. Parberry, "A Computer Assisted Optimal Depth Lower Bound for Nine-Input Sorting Networks", Mathematical Systems Theory, Vol. 24, pp. 101-116, 1991.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H D. Bundala, M. Codish, L. Cruz-Filipe et al., <a href="http://arxiv.org/abs/1412.5302">Optimal-Depth Sorting Networks</a>, arXiv preprint arXiv:1412.5302 [cs.DS], 2014.

%H Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp, <a href="http://arxiv.org/abs/1405.5754">Twenty-Five Comparators is Optimal when Sorting Nine Inputs (and Twenty-Nine for Ten)</a>, arXiv:1405.5754 [cs.DM], 2014.

%H Bert Dobbelaere, <a href="http://users.telenet.be/bertdobbelaere/SorterHunter/sorting_networks.html">Smallest and fastest sorting networks for a given number of inputs</a>

%H Milton W. Green, <a href="/A003075/a003075.pdf">Letter to N. J. A. Sloane, 1973</a>.

%H Jannis Harder, <a href="https://github.com/jix/sortnetopt">Lower Size Bounds for Sorting Networks</a>

%H Mariana Nagy, Vlad-Florin Drăgoi, Valeriu Beiu, <a href="https://doi.org/10.1109/NANO47656.2020.9183395">Employing Sorting Nets for Designing Reliable Computing Nets</a>, IEEE 20th International Conference on Nanotechnology (IEEE-NANO 2020) 370-375.

%H Ian Parberry, <a href="https://larc.unt.edu/ian/pubs/9-input.pdf">A Computer Assisted Optimal Depth Lower Bound for Nine-Input Sorting Networks</a>

%H Ed Pegg Jr., <a href="http://www.mathpuzzle.com/zenosort.gif">Illustration of initial terms</a>

%H <a href="/index/So#sorting">Index entries for sequences related to sorting</a>

%Y A006282 is an upper bound. Cf. A036604, A067782 (minimal depth).

%K hard,nonn,nice

%O 1,3

%A _N. J. A. Sloane_

%E Updates from _Ed Pegg Jr_, Dec 05 2001

%E Correction and update: terms are exact for n<=10. The precise values for n=9 and n=10 are established in the reference from 2014 by Codish et al. - _Michael Codish_, Jun 01 2014

%E Entry revised by _N. J. A. Sloane_, Jun 02 2014

%E a(11)-a(12) from _Jannis Harder_, Dec 10 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 24 23:25 EDT 2021. Contains 346273 sequences. (Running on oeis4.)