1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
 void fibonacci(int n) {
   int tmp;
   int result;
   int i;
   int b;
   int a;
   i = 0;
+  ⟨if (0 <= n) {
     a = 1;
   } else⟩ {
     a = 0;
   };
   b = 1;
   while (⟨i <= n⟩⟨(i + 1) <= n⟩) {
     tmp = (a + b) → i = (i + 1);
+    tmp = a;
     a = b;
+    b = (b + tmp);
-    b = tmp;
-    i = (i + 1);
   };
   result = a;

 }