Algorithms and Algorithm Analysis
Analysis of algorithms
- proofs of correctness
- asymptotic analysis (relative runtimes in the limit)
- strict analysis (actual number of operations)
- greedy vs. divide&conquer vs. backtracking etc.
Actual algorithms
- searching (linear search, binary search, tree search, hashing)
- sorting (heapsort, mergesort, quicksort, radixsort)
- graph algorithms (Dijkstra’s, Kruskal’s)