blob: 3792bde5c3281f1281536327dbafb6b82905248a (
plain)
1
2
3
4
5
6
7
8
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>
|
