From a99c753ae4713f67d5d659759bee70f883c1f644 Mon Sep 17 00:00:00 2001 From: rlacroix Date: Sun, 31 May 2020 23:23:27 +0200 Subject: [PATCH] added another great bunch o spaces --- TD_R_LACROIX_ENG_06-01-2020.adb | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/TD_R_LACROIX_ENG_06-01-2020.adb b/TD_R_LACROIX_ENG_06-01-2020.adb index 91bdcec..bec8eae 100644 --- a/TD_R_LACROIX_ENG_06-01-2020.adb +++ b/TD_R_LACROIX_ENG_06-01-2020.adb @@ -219,10 +219,10 @@ procedure td is while not Sorted loop for I in 1 .. NB_Swimmer-1 loop -- for every value if it is greater than the next one we swop them - if Arrival(I) > Arrival(I+1) then + if Arrival(I) > Arrival(I + 1) then Temp := Arrival(I); -- there to store a value - Arrival(I) := Arrival(I+1); - Arrival(I+1) := Temp; + Arrival(I) := Arrival(I + 1); + Arrival(I + 1) := Temp; Temp := 0.0; --reset end if; end loop; @@ -231,7 +231,7 @@ procedure td is --here we check for if it's sorted (if not we give it another go) Sorted := True; --it starts true for I in 1 .. NB_Swimmer-1 loop - if Arrival(I) > Arrival(I+1) then -- if a value is greater than the next one (as it's not supposed to be) + if Arrival(I) > Arrival(I + 1) then -- if a value is greater than the next one (as it's not supposed to be) Sorted := False; -- we set the sorted value to false end if; end loop; @@ -241,8 +241,8 @@ procedure td is --we then print out the lines for I in 1 .. NB_Swimmer loop J := 0; - while (Arrival(I) /= TableTime(J,3)) loop - J := J+1; + while (Arrival(I) /= TableTime(J, 3)) loop + J := J + 1; end loop; Put_Line("Swimmer " & Integer'Image(J) & " arrived in place " & Integer'Image(I) & " with a time of " & Float'Image(Arrival(I)-TDepart));