mario::konrad
programming / C++ / sailing / nerd stuff
Algorithms and Datastructures
© 2015 / Mario Konrad

This section is about algorithms and data structures. Examples are given, implemented mostly in C++ (C++11). Algorithms are probably implemented somewhere else as well (e.g. standard c++ library, etc.). This page just shows how such algorithms could be implemented.

Algorithms

Lists

Sorting

Trees

Graph

Geometry

Crypt / Cypher / Hash

Complexity

Big-O notation: O(n)O(n)

f(n)=O(g(n))f(n) = O(g(n)) means: existance of c elements of real number and the existance of n0 elements of natural numbers with f(n)<=c*round(g(n))f(n)<= c * round(g(n)) for all n>n0n > n0

Axioms:

if limngf\lim_{n\rightarrow\infty}\frac{g}{f} in \mathbb{R} then

Definitions for Sorting