1 | MergeSort(A, p, r):            | n = r - p, T(n) = 2 * T(n/2) + E(1) + T'(n) = 2 * T(n/2) + E(n)
 2 | if p < r then                  | E(1)
 3 |     q <- (p+r)/2               | E(1)
 4 |     MergeSort(A, p, q)         | T(n/2)
 5 |     MergeSort(A, q + 1, r)     | T(n/2)
 6 |     Merge(A, p, q, r)          | T'(n)
 7 |
 8 |
 9 |
10 |
11 | Merge(A, p, q, r):             | n = r - p, T'(n) = "6 * E(1)" + "4 * E(n)" = E(n)
12 | n1 <- q - p + 1                | E(1)
13 | n2 <- r - q                    | E(1)
14 |
15 | define L, R                    | E(n)
16 |
17 | for i <- 1 to n1 do            | E(n)
18 |     L[i] <- A[p + i - 1]       | -- E(1)
19 |
20 | for j <- 1 to n2 do            | E(n)
21 |     R[j] <- A[q + j]           | -- E(1)
22 |
23 | L[n1 + 1] <- infty             | E(1)
24 | R[n2 + 1] <- infty             | E(1)
25 | i <- 1                         | E(1)
26 | j <- 1                         | E(1)
27 |
28 | for k <- p to r do             | E(n)
29 |     if L[i] <= R[j] then       | -- E(1)
30 |         A[k] <- L[i]           | -- E(1)
31 |         i <- i + 1             | -- E(1)
32 |     else
33 |         A[k] <- R[j]           | -- E(1)
34 |         j <- j + 1             | -- E(1)

import java.lang.Runtime.*; 
import java.lang.Process.*; 
  
public class P1{ 
  public static void main(String[] args){ 
    System.out.print("Geben Sie ein Zahl an: "); 
    int a = SavitchIn.readLineInt(); 
    System.out.println("fib("+a+") = " + fibonacci(a)); 
  } 
    
  private static int fibonacci(int a){ 
    if (a==1||a==2) return 1; 
    else return fibonacci(a-1)+fibonacci(a-2); 
  } 
    
}

private static int fibonacci(int a){ 
    
Process p = Runtime.getRuntime().exec(java P1);

if (a==1||a==2) return 1;
 
    else return System.exit(fibonacci(a-1)+fibonacci(a-2)); 
  } 

private static int fibonacci(int a){ 
    
    Process p = Runtime.getRuntime().exec(java P1);
    if (a==1||a==2) return 1;
    else System.exit(fibonacci(a-1)+fibonacci(a-2)); 
  }