Jupyter Notebooks for the course Algorithms and Datastructures

This repository contains Jupyter Notebooks for the course Algorithm and Datastructures, taught in Spring 2020 at the University of Basel.

Name		Name	Last commit message	Last commit date
Latest commit History 185 Commits
binder		binder
.gitignore		.gitignore
Arrays-dynamisch.ipynb		Arrays-dynamisch.ipynb
Arrays-in-python.ipynb		Arrays-in-python.ipynb
BinarySearchTrees.ipynb		BinarySearchTrees.ipynb
Hashfunctions.ipynb		Hashfunctions.ipynb
Hashtables.ipynb		Hashtables.ipynb
Heap.ipynb		Heap.ipynb
LinkedLists.ipynb		LinkedLists.ipynb
README.md		README.md
RedBlackBST.ipynb		RedBlackBST.ipynb
Stringsort.ipynb		Stringsort.ipynb
Symboltable-ordered.ipynb		Symboltable-ordered.ipynb
Symboltable.ipynb		Symboltable.ipynb
Trees.ipynb		Trees.ipynb
fundamental-adts.ipynb		fundamental-adts.ipynb
graph_exploration.ipynb		graph_exploration.ipynb
graph_exploration_applications.ipynb		graph_exploration_applications.ipynb
heap-sort-informell.ipynb		heap-sort-informell.ipynb
landau.ipynb		landau.ipynb
logarithms.ipynb		logarithms.ipynb
merge_sort.ipynb		merge_sort.ipynb
mst.ipynb		mst.ipynb
priority-queues.ipynb		priority-queues.ipynb
python_intro.ipynb		python_intro.ipynb
quicksort.ipynb		quicksort.ipynb
radix_sort.ipynb		radix_sort.ipynb
selection_sort.ipynb		selection_sort.ipynb
shortest_paths.ipynb		shortest_paths.ipynb
tries.ipynb		tries.ipynb
two-stack-algorithm.ipynb		two-stack-algorithm.ipynb

unibas-marcelluethi/algodata-notebooks-gyminf