-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path04_max_seq.c
More file actions
49 lines (45 loc) · 1.14 KB
/
Copy path04_max_seq.c
File metadata and controls
49 lines (45 loc) · 1.14 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
/*@ requires n >= 0;
requires \valid(a + (0..n-1));
assigns \nothing;
behavior empty:
assumes n == 0;
ensures \result == 0;
behavior not_empty:
assumes 0 < n;
ensures 0 <= \result < n;
ensures \forall integer i; 0 <= i < n ==> a[i] <= a[\result];
ensures \forall integer i; 0 <= i < \result ==> a[i] < a[\result];
complete behaviors;
disjoint behaviors;
*/
int max_element(int* a, int n)
{
if (n == 0) {
return 0;
}
int max = 0;
/*@
loop invariant 0 <= i <= n;
loop invariant 0 <= max < n;
loop invariant \forall integer k; 0 <= k < i ==> a[k] <= a[max];
loop invariant \forall integer k; 0 <= k < max ==> a[k] < a[max];
loop assigns max, i;
loop variant n-i;
*/
for (int i = 1; i < n; i++) {
if (a[max] < a[i]) {
max = i;
}
}
return max;
}
/*@ requires n > 0;
requires \valid(p + (0..n-1));
assigns \nothing;
ensures \forall integer i; 0 <= i <= n-1 ==> \result >= p[i];
ensures \exists integer e; 0 <= e <= n-1 && \result == p[e];
*/
int max_seq(int* p, int n)
{
return p[max_element(p, n)];
}