Array Sort Function

131,473 Views

Report

• Sort(Items : []t, IsAscending : logic, Comparer: type{_(:t, :t)<computes> : int} where t : type)<computes> : []t = 
      if (Items.Length > 1, Pivot := Items[Floor(Items.Length/2)]):
          Left := for(Item : Items, Comparer(Item, Pivot) < 0) do Item 
          Middle := for(Item : Items, Comparer(Item, Pivot) = 0) do Item
          Right := for(Item : Items, Comparer(Item, Pivot) > 0) do Item
          if(IsAscending?):
              Sort(Left, IsAscending, Comparer) + Middle + Sort(Right, IsAscending, Comparer)
          else: 
              Sort(Right, IsAscending, Comparer) + Middle + Sort(Left, IsAscending, Comparer)
      else:    
          Items 
  
  CompareInts(A : int, B : int)<computes>: int = 
      if(A < B) then -1
      else if(A > B) then 1
      else 0
  
  #How to use it:
  SortedItems := Sort(Items, true, CompareInts)
  

  Sort(Items : []t, IsAscending : logic, Comparer: type{_(:t, :t)<computes> : int} where t : type)<computes> : []t = if (Items.Length > 1, Pivot := Items[Floor(Items.Length/2)]): Left := for(Item : Items, Comparer(Item, Pivot) < 0) do Item Middle := for(Item : Items, Comparer(Item, Pivot) = 0) do Item Right := for(Item : Items, Comparer(Item, Pivot) > 0) do Item if(IsAscending?): Sort(Left, IsAscending, Comparer) + Middle + Sort(Right, IsAscending, Comparer) else: Sort(Right, IsAscending, Comparer) + Middle + Sort(Left, IsAscending, Comparer) else: Items CompareInts(A : int, B : int)<computes>: int = if(A < B) then -1 else if(A > B) then 1 else 0 #How to use it: SortedItems := Sort(Items, true, CompareInts)