This repository contains all the Datastructures and Algorithms that were discussed in the Algorithms and Datastructures Course [Autumn 2018 | BSc Computer Science] at the Swiss Federal Institute of Technology.
-
Search algorithms
- Linear-Search
- Binary-Search
- Exponential-Search
-
Sort algorithms
- Bubble-Sort
- Insertion-Sort
- Selection-Sort
- Heap-Sort
- Merge-Sort
- Quick-Sort
-
Graphs
- MonoGraphs
- DiGraphs
- Weighted MonoGraphs
- Weighted DiGraphs
- Breadth First Search / Shortest-Pathfinder
- Depth First Search / Pathfinder
- Topological Sorting
- Directed Cycle finder
- Prims Minimal Span Tree Algorithm
- Kruskals Minimal Span Tree Algorithm
- Dijkstras Shortest Path Algorithm
-
Dynamic Programming
- Calculating Fibonacci numbers
- 0/1 Knapsack
- Coin-Change Problem [Hackerank.com]
- Maximum Subarray
- Largest Ascending/Descending Subsequence
-
Misc. [Not part of the course, but interesting nonetheless]
- Prime factorisation algorithm
- Euclidean GCD-Algorithm
- Generators of Cyclic Groups (Euler-Function)
This repository and its content is meant as an exam-preparation and was made by me, a student of ETH-Zurich, to practice the concepts of the course. It is in no way connected to the university itself and ETH-Zurich may not be held responsible for any content.