http://blogs.teamb.com/craigstuntz/2005/09/09/21077/ News of interest to Delphi, .NET, and InterBase programmers Sat, 22 Nov 2008 12:54:42 +0000 http://wordpress.org/?v=2.6.2 http://blogs.teamb.com/craigstuntz/2005/09/09/21077/#comment-405 Florent OUCHET Mon, 12 Sep 2005 12:09:34 +0000 http://blogs.teamb.com/craigstuntz/2005/09/09/21073/#comment-405 You're right, understanding and explaining an algorithm is always difficult by text. You’re right, understanding and explaining an algorithm is always difficult by text.

]]> http://blogs.teamb.com/craigstuntz/2005/09/09/21077/#comment-404 Craig Stuntz Mon, 12 Sep 2005 09:14:08 +0000 http://blogs.teamb.com/craigstuntz/2005/09/09/21073/#comment-404 As the excerpt I posted makes quite clear, the technique uses a heapsort, but there's quite a bit more to it. A "vanilla" heapsort cannot make these claims for worst-case efficiency. As the excerpt I posted makes quite clear, the technique uses a heapsort, but there’s quite a bit more to it. A "vanilla" heapsort cannot make these claims for worst-case efficiency.

]]> http://blogs.teamb.com/craigstuntz/2005/09/09/21077/#comment-403 Florent OUCHET Sun, 11 Sep 2005 17:01:01 +0000 http://blogs.teamb.com/craigstuntz/2005/09/09/21073/#comment-403 Isn't it called heap sort ? Isn’t it called heap sort ?

]]>