<?xml version="1.0" encoding="windows-1252"?>
<node id="998184" title="Re^3: Numeric sorting WITHOUT &lt;=&gt;" created="2012-10-10 05:40:14" updated="2012-10-10 05:40:14">
<type id="11">
note</type>
<author id="163790">
dsheroh</author>
<data>
<field name="doctext">
If he's talking about nested loops, then you're probably not supposed to use the Perl &lt;c&gt;sort&lt;/c&gt; function at all, but instead to implement a sorting algorithm from scratch.  Hopefully, then, the class has already covered at least one sorting algorithm for you to implement.  If not, google can provide explanations of how several sorting algorithms work, then it's just a matter of translating the algorithm's description into Perl code.
</field>
<field name="root_node">
998088</field>
<field name="parent_node">
998094</field>
</data>
</node>
