TY  - CHAP
AU  - Apke, Alexander
AU  - Weil, Vera
AU  - Dörpinghaus, Jens
AU  - Schaaf, Sebastian
TI  - Algorithm Design; 1st ed. 2022
VL  - 112
CY  - Cham
PB  - Springer International Publishing
M1  - DZNE-2023-00421
SN  - 978-3-031-08411-9
T2  - Studies in Big Data
SP  - 79-98
PY  - 2022
AB  - In this chapter, we have a closer look at algorithms and the challenges that lie in designing “good” algorithms. We show how a real world problem can be modeled in a way that an algorithm can understand and solve it. Further, we introduce the Big O Notation as a concept for quantifying the efficiency of algorithms. We will know the difference between the complexity classes P and NP and discover some very important basic paradigms in designing efficient algorithms.
LB  - PUB:(DE-HGF)7
DO  - DOI:10.1007/978-3-031-08411-9_4
UR  - https://pub.dzne.de/record/257352
ER  -