Contribution to a book

DZNE-2023-00421

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Algorithm Design

Apke, A. ; Weil, V. ; Dörpinghaus, J.DZNE* ; Schaaf, S. (Last author)DZNE*

2022
Springer International Publishing Cham
ISBN: 978-3-031-08411-9

This record in other databases:

Please use a persistent id in citations: doi:10.1007/978-3-031-08411-9_4

Abstract: 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.

Keyword(s): Engineering—Data processing (LCSH) ; Bioinformatics (LCSH) ; Big data (LCSH) ; Computational intelligence (LCSH)

---

Contributing Institute(s):

1. GenomMathematik in der Neuroepidemiologie (AG Becker)
2. Clinical Research Coordination (AG Klockgether)

Research Program(s):

1. 354 - Disease Prevention and Healthy Aging (POF4-354) (POF4-354)
2. 353 - Clinical and Health Care Research (POF4-353) (POF4-353)

Appears in the scientific report 2022

---