%0 Book Section
%A Apke, Alexander
%A Weil, Vera
%A Dörpinghaus, Jens
%A Schaaf, Sebastian
%T Algorithm Design; 1st ed. 2022
%V 112
%C Cham
%I Springer International Publishing
%M DZNE-2023-00421
%@ 978-3-031-08411-9
%B Studies in Big Data
%P 79-98
%D 2022
%< [Ebook] Computational Life Sciences : Data Engineering and Data Mining for Life Sciences / Dörpinghaus, Jens ; Weil, Vera ; Schaaf, Sebastian ; Apke, Alexander 1st ed. 2022, Cham : Springer International Publishing, 2022,
%X 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.
%F PUB:(DE-HGF)7
%9 Contribution to a book
%R 10.1007/978-3-031-08411-9_4
%U https://pub.dzne.de/record/257352