From 4b6c0e31385f5f27a151088c0a2b614495c4e589 Mon Sep 17 00:00:00 2001
From: Paul Duncan <pabs@pablotron.org>
Date: Thu, 14 Oct 2021 12:47:50 -0400
Subject: initial commit, including theme

---
 content/posts/2003-11-07-faster-than-qsort.html | 9 +++++++++
 1 file changed, 9 insertions(+)
 create mode 100644 content/posts/2003-11-07-faster-than-qsort.html

(limited to 'content/posts/2003-11-07-faster-than-qsort.html')

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>
+
-- 
cgit v1.2.3