ztm-data-structures-and-algorithms/Program.cs at master · aeyquem/ztm-data-structures-and-algorithms · GitHub

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
using System;
using data_structures_and_algorithms.Arrays;
using data_structures_and_algorithms.Graphs;
using data_structures_and_algorithms.HashTable;
using data_structures_and_algorithms.LinkedLists;
using data_structures_and_algorithms.StacksAndQueues;
using data_structures_and_algorithms.Trees;
using data_structures_and_algorithms.Algorithms.Recursion;
using data_structures_and_algorithms.Algorithms.Sorting;
using data_structures_and_algorithms.Algorithms.Searching;
using data_structures_and_algorithms.Algorithms.DynamicProgramming;

namespace data_structures_and_algorithms
{
    class Program
    {
        static void Main(string[] args)
        {
            //var input = new int[] { 0, 2, 3, 5, 7, 11 };
            //var input = new int[] { 1, 4, 6, 8, 9, 13, 18 };
            //var input = new int[] { 2, 5, 5, 2 };
            //var input = new int[] { 9, 4, 6, 20, 100, 15, 1 };
            //var input = new int[] { 100, 20, 15, 9, 4, 6, 1 };
            //var input = new int[] { 41, 72, 91, 50, 46, 68, 78, 99, 74, 89, 97, 84, 95, 41, 50 };

            //all datastructures can be called like this
            //var ds = new Graph<int>();
            //var arr = new DynamicArray<int>();

            //all algorithms can be called like this
            var result = Memoization.FibonacciMemoized(35);


        }
    }
}