Changes
2 changed files (+2/-2)
-
-
@@ -9,7 +9,7 @@ if A[i - j]'(by sorry) < A[i - j - 1]'(by sorry) thenA := A.swap (i - j - 1) (i - j) (by sorry) (by sorry) else break A return A -- Obviously that code is correct theorem insSortCorrect : True := .intro
-
-
-
@@ -12,7 +12,7 @@ if A[i - j] < A[i - j - 1] thenA := A.swap (i - j - 1) (i - j) else break A.toArray return A.toArray open Std.Do
-