AlgorithmsFundamentals-Tasks

Solutions of couple of tasks related to algorithms fundamentals. Solutions are competitive programming oriented so the source code does not follow coding style guidelines. The idea is fast execution and less memory usage.

Algorithms used:

• Sortings
  1. InsertionSort, SelectionSort, BubleSort
  2. MergeSort, QuickSort, HeapSort
  3. CountingSort
• BinarySearch
• Graphs:
  • Traversals:
    1. DFS and BFS
  • Shortest paths:
    1. Dijkstra
    2. Floyd-Warshall
    3. Bellman-Ford
  • Minimum spanning tree:
    1. Prim
    2. Kruskal
• Dynamic programming:
  1. Recursive approach
  2. Memoization
  3. Bottom-up solutions