Heap Data Structure And Sort

1941 Views

Report

• Arrays<public> := module:
  
      <# Array utility to swap the elements contained in indices I and J #>
      (Array:[]t where t:type).Swap<public>(FirstIndex:int, SecondIndex:int)<decides><transacts>:[]t =
          ArrayTemp := Array.ReplaceElement[FirstIndex, Array[SecondIndex]]
          return ArrayTemp.ReplaceElement[SecondIndex, Array[FirstIndex]]
  
  
  Heaps<public> := module:
  
      using { Arrays }
  
      MinHeap<public>(t:type) := class<concrete>:
  
          # Properties 
          Heap<internal>:[]t = array{}
          Size<internal>:int = 0
          LessThan<internal>:?type{_(:t,:t)<decides><transacts>:void} = false
          Equivalent<internal>:?type{_(:t,:t)<decides><transacts>:void} = false
  
          # Get the size of the heap array
          GetSize<public>()<transacts>:int =
              Size
  
          # Get a copy of the heap array 
          GetHeap<public>()<transacts>:[]t =
              Heap