···

       
176
       
176
       
 
       
  # elements and returns true if the first argument is strictly below

     

       
177
       
177
       
 
       
  # the second argument.  The returned list is sorted in an increasing

     

       
178
       
178
       
 
       
  # order.  The implementation does a quick-sort.

     

       
179
       
179
       
-
       
  sort = strictLess: list:

     

       
179
       
179
       
+
       
  sort = builtins.sort or (

     

       
180
       
180
       
+
       
    strictLess: list:

     

       
180
       
181
       
 
       
    let

     

       
181
       
182
       
 
       
      len = length list;

     

       
182
       
183
       
 
       
      first = head list;

     
···

       
190
       
191
       
 
       
      pivot = pivot' 1 { left = []; right = []; };

     

       
191
       
192
       
 
       
    in

     

       
192
       
193
       
 
       
      if len < 2 then list

     

       
193
       
193
       
-
       
      else (sort strictLess pivot.left) ++  [ first ] ++  (sort strictLess pivot.right);

     

       
194
       
194
       
+
       
      else (sort strictLess pivot.left) ++  [ first ] ++  (sort strictLess pivot.right));

     

       
194
       
195
       
 
       


     

       
195
       
196
       
 
       


     

       
196
       
197
       
 
       
  # Return the first (at most) N elements of a list.