supleed2/ELEC70056-HSV-CW1
1
0
Fork 0
mirror of https://github.com/supleed2/ELEC70056-HSV-CW1.git synced 2024-11-10 02:15:47 +00:00
Code Issues Packages Projects Releases Wiki Activity

Dafny Task 2 complete

Browse source
This commit is contained in:
Aadi Desai 2022-11-21 13:51:44 +00:00
parent 30874e2405
commit 88e407c8f7
No known key found for this signature in database
GPG key ID: CFFFE425830EF4D9
1 changed files with 29 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

33
dafny/submission.dfy
View file

@ -34,13 +34,16 @@ method countsquares2(n:nat) returns (result:nat)
} }
predicate sorted(A:array<int>) predicate sorted(A:array<int>)
reads A reads A;
{ {
forall m,n :: 0 <= m < n < A.Length ==> A[m] <= A[n] forall m,n :: 0 <= m < n < A.Length ==> A[m] <= A[n]
} }
method binarysearch_between(A:array<int>, v:int, lo:int, hi:int) returns (result:bool) method binarysearch_between(A:array<int>, v:int, lo:int, hi:int) returns (result:bool)
requires false // Please remove this line. requires sorted(A);
requires 0 <= lo <= hi <= A.Length;
decreases hi - lo;
ensures (exists j :: lo <= j < hi && A[j] == v) <==> result;
{ {
if lo == hi { if lo == hi {
return false; return false;
@ -58,14 +61,34 @@ method binarysearch_between(A:array<int>, v:int, lo:int, hi:int) returns (result
} }
method binarysearch(A:array<int>, v:int) returns (result:bool) method binarysearch(A:array<int>, v:int) returns (result:bool)
requires false // Please remove this line. requires sorted(A);
ensures (exists j :: 0 <= j < A.Length && A[j] == v) <==> result;
{ {
result := binarysearch_between(A, v, 0, A.Length); result := binarysearch_between(A, v, 0, A.Length); // call with lo and hi to cover full array
} }
method binarysearch_iter(A:array<int>, v:int) returns (result:bool) method binarysearch_iter(A:array<int>, v:int) returns (result:bool)
requires sorted(A);
ensures (exists j :: 0 <= j < A.Length && A[j] == v) <==> result;
{ {
// Please provide an implementation of this method. result := false;
var lo := 0;
var hi := A.Length;
while lo < hi
invariant 0 <= lo <= hi <= A.Length;
invariant forall j :: 0 <= j < lo ==> A[j] != v;
invariant forall j :: hi <= j < A.Length ==> A[j] != v;
decreases hi - lo;
{
var mid := (lo + hi) / 2;
if A[mid] > v {
hi := mid;
} else if A[mid] < v {
lo := mid + 1;
} else {
return true;
}
}
} }
method partition(A:array<int>, lo:int, hi:int) returns (pivot:int) method partition(A:array<int>, lo:int, hi:int) returns (pivot:int)