<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta content="text/html;charset=ISO-8859-1" http-equiv="Content-Type">
</head>
<body dir="ltr" bgcolor="#ffffff" text="#000000">
Diego Iastrubni wrote:
<blockquote cite="mid:200904261857.44335.elcuco@kde.org" type="cite">
<pre wrap="">On Sunday 26 April 2009 17:31:59 Shachar Shemesh wrote:
</pre>
<blockquote type="cite">
<blockquote type="cite">
<pre wrap="">Go back to school, and as punishment re-implement quick_sort in VB.NET.
</pre>
</blockquote>
<pre wrap="">Now that's going the "cruel and unusual" route.
I do think every programmer should take the time to implement binary
search and quick sort at least once from scratch. The number of corner
cases there is outstanding, and it is a great practice of thinking of
the fine details.
</pre>
</blockquote>
<pre wrap=""><!---->
Beeing a little serious:
I am not sure quick_sort is a must, as quite frankly it's a reall mess and I
don't understand it.</pre>
</blockquote>
Sounds like an excellent reason to go there.<br>
<blockquote cite="mid:200904261857.44335.elcuco@kde.org" type="cite">
<pre wrap=""> But heap sort and binary sort, yes. Those are a must.
</pre>
</blockquote>
Heap sort is fairly straight forward once you have the heap. I do
believe every programmer should know how to write a heap (preferably, a
compressed one, where you keep no node pointers).<br>
<br>
Shachar<br>
<br>
<pre class="moz-signature" cols="72">--
Shachar Shemesh
Lingnu Open Source Consulting Ltd.
<a class="moz-txt-link-freetext" href="http://www.lingnu.com">http://www.lingnu.com</a>
</pre>
</body>
</html>