<feed xmlns='http://www.w3.org/2005/Atom'>
<title>openbsd/src/regress/lib/libc/qsort/Makefile, branch master</title>
<subtitle>A mirror of https://github.com/libressl/openbsd.git
</subtitle>
<id>https://git.lua4.win/openbsd/atom?h=master</id>
<link rel='self' href='https://git.lua4.win/openbsd/atom?h=master'/>
<link rel='alternate' type='text/html' href='https://git.lua4.win/openbsd/'/>
<updated>2017-05-22T17:16:43+00:00</updated>
<entry>
<title>Instead of embedding pre-generated tables from  McIlroy's "A Killer</title>
<updated>2017-05-22T17:16:43+00:00</updated>
<author>
<name>millert</name>
<email></email>
</author>
<published>2017-05-22T17:16:43+00:00</published>
<link rel='alternate' type='text/html' href='https://git.lua4.win/openbsd/commit/?id=c6a610ee008733eeb3365f48f5063d48e0f0825d'/>
<id>urn:sha1:c6a610ee008733eeb3365f48f5063d48e0f0825d</id>
<content type='text'>
Adversary for Quicksort", just include the code to generate them.
Also allow the number of elements to be specified on the command line.
</content>
</entry>
<entry>
<title>Approximate nlgn instead of using libm.  The same approximation may</title>
<updated>2017-05-17T20:28:35+00:00</updated>
<author>
<name>millert</name>
<email></email>
</author>
<published>2017-05-17T20:28:35+00:00</published>
<link rel='alternate' type='text/html' href='https://git.lua4.win/openbsd/commit/?id=8d603a07f4d3001dcb3dbd41181d29c15d99b605'/>
<id>urn:sha1:8d603a07f4d3001dcb3dbd41181d29c15d99b605</id>
<content type='text'>
be used in qsort.c in a later commit.
</content>
</entry>
<entry>
<title>Add qsort(3) regress based on Bentley &amp; McIlroy's "Engineering a Sort Function"</title>
<updated>2017-05-17T14:47:06+00:00</updated>
<author>
<name>millert</name>
<email></email>
</author>
<published>2017-05-17T14:47:06+00:00</published>
<link rel='alternate' type='text/html' href='https://git.lua4.win/openbsd/commit/?id=6d4998d3ac11a8130ca936f9191bfad63fecd367'/>
<id>urn:sha1:6d4998d3ac11a8130ca936f9191bfad63fecd367</id>
<content type='text'>
</content>
</entry>
</feed>
