Re: Invade wikipedia!

[Anders Wirzenius <anders@no.email.thanks.invalid>]

"Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> writes:

>    procedure Insertion_Sort (A: in out Mug_List) is
>    begin
>       for I in A'First + 1..A'Last loop
>          declare
>             Value : constant Mug := A (I);
>             J     : Mug_Number   := I - 1;
>          begin
>             while A (J) > Value loop
>                A (J + 1) := A (J);
>                exit when J = A'First;
>                J := J - 1;
>             end loop;
>             A (J) := Value;
              ^^^^^
How  about    A (J+1) := Value;

>          end;
>       end loop;
>    end Insertion_Sort;
>
> Of course an Ada purist would also replace integer index arithmetic with 
> I'Succ and I'Pred. But that would likely be too much for wiki brains... 
> (:-))

-- 
Anders