diff options
| author | Paul Duncan <pabs@pablotron.org> | 2021-10-14 12:47:50 -0400 |
|---|---|---|
| committer | Paul Duncan <pabs@pablotron.org> | 2021-10-14 12:47:50 -0400 |
| commit | 4b6c0e31385f5f27a151088c0a2b614495c4e589 (patch) | |
| tree | 12243cdcd00704bc1a9d94ac9cc128459417370c /content/posts/2003-11-07-faster-than-qsort.html | |
| download | pablotron.org-4b6c0e31385f5f27a151088c0a2b614495c4e589.tar.bz2 pablotron.org-4b6c0e31385f5f27a151088c0a2b614495c4e589.zip | |
initial commit, including theme
Diffstat (limited to 'content/posts/2003-11-07-faster-than-qsort.html')
| -rw-r--r-- | content/posts/2003-11-07-faster-than-qsort.html | 9 |
1 files changed, 9 insertions, 0 deletions
diff --git a/content/posts/2003-11-07-faster-than-qsort.html b/content/posts/2003-11-07-faster-than-qsort.html new file mode 100644 index 0000000..3792bde --- /dev/null +++ b/content/posts/2003-11-07-faster-than-qsort.html @@ -0,0 +1,9 @@ +--- +date: "2003-11-07T10:15:06Z" +title: Faster than qsort()? +--- + +<p> +I saw a link to <a href='http://www.cs.rpi.edu/~musser/gp/introsort.ps'>Introspective Sorting</a> over at <a href='http://www.rubygarden.org/'>Ruby Garden</a>. According to the calculations, the author believes it's better than <code>qsort()</code>. Basically it is <code>qsort()</code>, except it switches to heapsort in worst-case scenarios for <code>qsort()</code>. Really interesting read. +</p> + |