About this document

Einführung in Algorithmen und Analyse by Lalith Kartikeya is a document available to read on EtoBox.

An algorithm is a step-by-step procedure to solve a problem and obtain an output from given inputs in a finite amount of time. It was first proposed by a Persian mathematician in 825 AD. An algorithm must have a finite number of steps, be unambiguous, have zero or more inputs, produce one or more outputs, and have clearly defined relationships between steps. The time and space complexity of algorithms can be analyzed using asymptotic notations like Big O, Big Omega, and Big Theta to classify algorithms base

Author

Lalith Kartikeya

Language

EN