1#include <stdio.h>
2
3void merge(int arr[], int left, int mid, int right) {
4    int i, j, k;
5    int n1 = mid - left + 1;
6    int n2 = right - mid;
7    int L[n1], R[n2];
8
9    for (i = 0; i < n1; i++)
10        L[i] = arr[left + i];
11    for (j = 0; j < n2; j++)
12        R[j] = arr[mid + 1 + j];
13
14    i = 0;
15    j = 0;
16    k = left;
17    while (i < n1 && j < n2) {
18        if (L[i] <= R[j]) {
19            arr[k] = L[i];
20            i++;
21        } else {
22            arr[k] = R[j];
23            j++;
24        }
25        k++;
26    }
27
28    while (i < n1) {
29        arr[k] = L[i];
30        i++;
31        k++;
32    }
33
34    while (j < n2) {
35        arr[k] = R[j];
36        j++;
37        k++;
38    }
39}
40
41void mergeSort(int arr[], int left, int right) {
42    if (left < right) {
43        int mid = left + (right - left) / 2;
44
45        mergeSort(arr, left, mid);
46        mergeSort(arr, mid + 1, right);
47
48        merge(arr, left, mid, right);
49    }
50}
51
52int main() {
53    int arr[] = {12, 11, 13, 5, 6, 7};
54    int arr_size = sizeof(arr) / sizeof(arr[0]);
55
56    mergeSort(arr, 0, arr_size - 1);
57
58    printf("Sorted array: \n");
59    for (int i = 0; i < arr_size; i++)
60        printf("%d ", arr[i]);
61    return 0;
62}

1using System;
2
class Fibonacci {
    int Fib(int n, int[] dp) {
        if (n <= 1) return n;
        if (dp[n] != -1) return dp[n];
        return dp[n] = Fib(n-1, dp) + Fib(n-2, dp);
    }

    public static void Main(string[] args) {
        int n = 10;
        int[] dp = new int[n + 1];
        Array.Fill(dp, -1);
        Fibonacci fibonacci = new Fibonacci();
        Console.WriteLine("Fibonacci number is " + fibonacci.Fib(n, dp));
    }
}