ADA - ordenacion recursiva de coleccion de numeros

procedure QuickSort (Arr : in out Num_Array; Low : Positive; High : Positive) is

   Pivot : Num;

   Left, Right : Positive;

begin

   if Low < High then

      Pivot := Arr(High);

      Left := Low;

      Right := High - 1;

      while Left <= Right loop

         while Left <= Right and then Arr(Left) < Pivot loop

            Left := Left + 1;

         end loop;

         while Right >= Left and then Arr(Right) >= Pivot loop

            Right := Right - 1;

         end loop;

         if Left < Right then

            Swap(Arr(Left), Arr(Right));

         end if;

      end loop;

      Swap(Arr(Left), Arr(High));

      QuickSort(Arr, Low, Left - 1);

      QuickSort(Arr, Left + 1, High);

   end if;

end QuickSort;

procedure Swap (A, B : in out Num) is

   Temp : Num := A;

begin

   A := B;

   B := Temp;

end Swap;

declare

   -- Definir el tipo Num_Array y la colección de números a ordenar

   type Num_Array is array(Positive range <>) of Num;

   Arr : Num_Array := (10, 5, 8, 2, 1, 7, 3);

begin

   -- Llamar a QuickSort para ordenar la colección completa

   QuickSort(Arr, Arr'First, Arr'Last);

   -- Realizar acciones con la colección ordenada

   -- ...

end;