supleed2/ELEC70056-HSV-CW1
1
0
Fork 0
mirror of https://github.com/supleed2/ELEC70056-HSV-CW1.git synced 2024-09-19 20:46:16 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add verfication for partition

Browse source
This commit is contained in:
ajs19 2022-11-21 17:30:48 +00:00
parent 88e407c8f7
commit b97546132c
1 changed files with 13 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

18
dafny/2022/tasks_2022.dfy
View file

@ -36,7 +36,7 @@ method binarysearch_between(A:array<int>, v:int, lo:int, hi:int) returns (result
{ {
if lo == hi { if lo == hi {
return false; return false;
} }
var mid:int := (lo + hi) / 2; var mid:int := (lo + hi) / 2;
if v == A[mid] { if v == A[mid] {
return true; return true;
@ -57,12 +57,12 @@ method binarysearch(A:array<int>, v:int) returns (result:bool)
method binarysearch_iter(A:array<int>, v:int) returns (result:bool) method binarysearch_iter(A:array<int>, v:int) returns (result:bool)
{ {
// Please provide an implementation of this method. // Please provide an implementation of this method.
} }
method partition(A:array<int>, lo:int, hi:int) returns (pivot:int) method partition(A:array<int>, lo:int, hi:int) returns (pivot:int)
requires 0 <= lo < hi <= A.Length requires 0 <= lo < hi <= A.Length
ensures 0 <= lo <= pivot < hi ensures 0 <= lo <= pivot < hi <= A.Length
ensures forall k :: (0 <= k < lo || hi <= k < A.Length) ==> old(A[k]) == A[k] ensures forall k :: (0 <= k < lo || hi <= k < A.Length) ==> old(A[k]) == A[k]
modifies A modifies A
{ {
@ -71,6 +71,9 @@ method partition(A:array<int>, lo:int, hi:int) returns (pivot:int)
while i < hi while i < hi
invariant 0 <= lo <= pivot < i <= hi invariant 0 <= lo <= pivot < i <= hi
invariant forall k :: (0 <= k < lo || hi <= k < A.Length) ==> old(A[k]) == A[k] invariant forall k :: (0 <= k < lo || hi <= k < A.Length) ==> old(A[k]) == A[k]
invariant forall k :: (k==pivot) ==> A[k] == old(A[lo])
invariant forall k :: (lo <= k <= pivot) ==> A[k] <= A[pivot]
invariant forall k :: (pivot <= k < i) ==> A[k] >= A[pivot]
decreases hi - i decreases hi - i
{ {
if A[i] < A[pivot] { if A[i] < A[pivot] {
@ -79,6 +82,10 @@ method partition(A:array<int>, lo:int, hi:int) returns (pivot:int)
A[i] := A[j]; A[i] := A[j];
while pivot < j while pivot < j
invariant forall k :: (0 <= k < lo || hi <= k < A.Length) ==> old(A[k]) == A[k] invariant forall k :: (0 <= k < lo || hi <= k < A.Length) ==> old(A[k]) == A[k]
invariant forall k :: (k==pivot) ==> A[k] == old(A[lo])
invariant forall k :: (pivot <= k <= i) ==> A[k] >= A[pivot]
invariant forall k :: (lo <= k <= pivot) ==> A[k] <= A[pivot]
invariant A[pivot] > tmp
decreases j decreases j
{ {
A[j+1] := A[j]; A[j+1] := A[j];
@ -106,15 +113,16 @@ method quicksort_between(A:array<int>, lo:int, hi:int)
method quicksort(A:array<int>) method quicksort(A:array<int>)
modifies A modifies A
ensures sorted(A)
{ {
quicksort_between(A, 0, A.Length); quicksort_between(A, 0, A.Length);
} }
method Main() { method Main() {
var A:array<int> := new int[7] [4,0,1,9,7,1,2]; var A:array<int> := new int[7] [4,0,1,9,7,1,2];
print "Before: ", A[0], A[1], A[2], A[3], print "Before: ", A[0], A[1], A[2], A[3],
A[4], A[5], A[6], "\n"; A[4], A[5], A[6], "\n";
quicksort(A); quicksort(A);
print "After: ", A[0], A[1], A[2], A[3], print "After: ", A[0], A[1], A[2], A[3],
A[4], A[5], A[6], "\n"; A[4], A[5], A[6], "\n";
} }